# 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

- Mathematics, Computer Science
- Electron. J. Comb.
- 2013

Covering and tiling hypergraphs with tight cycles

- Mathematics, Computer Science
- Electron. Notes Discret. Math.
- 2017

Partitioning Edge-Colored Hypergraphs into Few Monochromatic Tight Cycles

- Mathematics, Computer Science
- SIAM J. Discret. Math.
- 2020

Tight cycles and regular slices in dense hypergraphs

- Mathematics, Computer Science
- J. Comb. Theory, Ser. A
- 2017

The Ramsey Number for 3-Uniform Tight Hypergraph Cycles

- Computer Science, Mathematics
- Combinatorics, Probability and Computing
- 2009

Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture

- Computer Science, Mathematics
- J. Comb. Theory, Ser. B
- 2010

Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles

- Computer Science, Mathematics
- Combinatorics, Probability and Computing
- 2008

Almost partitioning 2?colored complete 3?uniform hypergraphs into two monochromatic tight or loose cycles

- Mathematics, Computer Science
- J. Graph Theory
- 2019