Towards Lehel's conjecture for 4-uniform tight cycles

Abstract: 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

n - o (n)

vertices.

Full work available at URL: https://arxiv.org/abs/2012.08875

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

Cites Work

Cited In (2)

This page was built for publication: Towards Lehel's conjecture for 4-uniform tight cycles