Corpus ID: 229188519

Towards Lehel's conjecture for 4-uniform tight cycles

@article{Lo2020TowardsLC,
  title={Towards Lehel's conjecture for 4-uniform tight cycles},
  author={A. Lo and Vincent Pfenninger},
  journal={arXiv: Combinatorics},
  year={2020}
}
A $k$-uniform tight cycle is a $k$-uniform hypergraph with a cyclic ordering of its vertices such that its edges are all the sets of size $k$ formed by $k$ consecutive vertices in the ordering. We prove that every red-blue edge-coloured $K_n^{(4)}$ contains a red and a blue tight cycle that are vertex-disjoint and together cover $n-o(n)$ vertices. Moreover, we prove that every red-blue edge-coloured $K_n^{(5)}$ contains four monochromatic tight cycles that are vertex-disjoint and together cover… Expand

References

SHOWING 1-10 OF 20 REFERENCES
Monochromatic Path and Cycle Partitions in Hypergraphs
Covering and tiling hypergraphs with tight cycles
Partitioning Edge-Colored Hypergraphs into Few Monochromatic Tight Cycles
Tight cycles and regular slices in dense hypergraphs
The Ramsey Number for 3-Uniform Tight Hypergraph Cycles
Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture
Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles
  • Peter Allen
  • Computer Science, Mathematics
  • Combinatorics, Probability and Computing
  • 2008
Partitioning a graph into a cycle and a sparse graph
Almost partitioning 2?colored complete 3?uniform hypergraphs into two monochromatic tight or loose cycles
...
1
2
...