Allan Lo

Suggest Changes
Learn More
Access to the published version may require subscription. Abstract. Let Hn be a k-graph on n vertices. For 0 ≤ ℓ < k and an ℓ-subset T of V (Hn), define the degree deg(T) of T to be the number of (k(More)
Let G be an edge-colored graph. The minimum color degree δc(G) of G is the largest integer k such that for every vertex v, there are at least k distinct colors on edges incident to v. We say that G(More)