Polynomial bounds for monochromatic tight cycle partition in r-edge-coloured K_n^(k)

DOI10.37236/13343MaRDI QIDQ6987869zbMATH OpenFDO

Authors Debmalya Bandyopadhyay, Allan Lo

Publication date 6 May 2025

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

Full work available at URL https://doi.org/10.37236/13343

zbMATH Keywords

\(k\)-uniform tight cyclerainbow subgraphs

Mathematics Subject Classification ID

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

Cites work

• \(R(C_n,C_n,C_n)\leqq (4+o(1))n\)
• Almost partitioning 2-colored complete 3-uniform hypergraphs into two monochromatic tight or loose cycles
• Almost partitioning every 2-edge-coloured complete k-graph into k monochromatic tight cycles
• An improved bound for the monochromatic cycle partition number
• Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles
• Decompositions of edge-colored infinite complete graphs into monochromatic paths
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• Improved monochromatic loose cycle partitions in hypergraphs
• Local k-colorings of graphs and hypergraphs
• Minimum degree conditions for monochromatic cycle partitioning
• Monochromatic partitions in local edge colorings
• Monochromatic path and cycle partitions in hypergraphs
• 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
• Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles
• Ramsey numbers of sparse hypergraphs
• Tight cycles and regular slices in dense hypergraphs
• Towards Lehel's conjecture for 4-uniform tight cycles
• Vertex coverings by monochromatic cycles and trees
• Vertex covers by monochromatic pieces -- a survey of results and problems

This page was built for publication: Polynomial bounds for monochromatic tight cycle partition in \(r\)-edge-coloured \(K_n^{(k)}\)

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