Towards Lehel's conjecture for 4-uniform tight cycles

DOI10.37236/10604MaRDI QIDQ2111790zbMATH OpenOpenAlexWikidataFDO

Authors Allan Lo, Vincent Pfenninger

Publication date 17 January 2023

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

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

zbMATH Keywords

2-edge-coloured complete \(k\)-graphsdegenerate cyclesmonochromatic tight cycle partitions

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

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.

Recommendations

• Partitioning 2-coloured complete \(k\)-uniform hypergraphs into monochromatic \(\ell\)-cycles
• Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles
• Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs
• Almost partitioning 2-colored complete 3-uniform hypergraphs into two monochromatic tight or loose cycles
• Partitioning edge-colored hypergraphs into few monochromatic tight cycles

Cites work

• Almost partitioning 2-colored complete 3-uniform hypergraphs into two monochromatic tight or loose cycles
• An improved bound for the monochromatic cycle partition number
• Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles
• Covering and tiling hypergraphs with tight cycles
• Improved monochromatic loose cycle partitions in hypergraphs
• Minimum degree conditions for tight Hamilton cycles
• Monochromatic path and cycle partitions in hypergraphs
• Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles
• Partitioning a graph into a cycle and a sparse graph
• Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture
• Partitioning edge-colored hypergraphs into few monochromatic tight cycles
• Partitioning edge-coloured complete graphs into monochromatic cycles and paths
• Star versus two stripes Ramsey numbers and a conjecture of Schelp
• The Ramsey number for 3-uniform tight hypergraph cycles
• Tight cycles and regular slices in dense hypergraphs
• Vertex coverings by monochromatic cycles and trees
• Vertex covers by monochromatic pieces -- a survey of results and problems
• \(R(C_n,C_n,C_n)\leqq (4+o(1))n\)

Cited in

(2)

• Monochromatic paths in 2-edge-coloured graphs and hypergraphs
• Ore- and Pósa-type conditions for partitioning 2-edge-coloured graphs into monochromatic cycles

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2111790)