Name
Abstract | ||
|---|---|---|
We show that for all ℓ,k,n with ℓ≤k∕2 and (k−ℓ) dividing n the following hypergraph-variant of Lehel’s conjecture is true. Every 2-edge-colouring of the k-uniform complete hypergraph Kn(k) on n vertices has at most two disjoint monochromatic ℓ-cycles in different colours that together cover all but at most 4(k−ℓ) vertices. If ℓ≤k∕3, then at most two ℓ-cycles cover all but at most 2(k−ℓ) vertices. Furthermore, we can cover all vertices with at most 4 (3 if ℓ≤k∕3) disjoint monochromatic ℓ-cycles. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.ejc.2018.04.005 | European Journal of Combinatorics |
Field | DocType | Volume |
Discrete mathematics,Monochromatic color,Combinatorics,Disjoint sets,Vertex (geometry),Hypergraph,Constraint graph,Conjecture,Mathematics | Journal | 71 |
ISSN | Citations | PageRank |
0195-6698 | 0 | 0.34 |
References | Authors | |
4 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sebastián Bustamante | 1 | 0 | 2.03 |
| maya stein | 2 | 81 | 15.65 |