Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs

DOI10.1016/J.JCTB.2007.07.002zbMath1140.05028OpenAlexW2112867544MaRDI QIDQ2477627

Gábor N. Sárközy, Jenő Lehel, Richard H. Schelp, András Gyárfás

Publication date: 14 March 2008

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2007.07.002

zbMATH Keywords

colored complete uniform hypergraphsmonochromatic Hamiltonian Berge-cyclesregularity Lemmaalmost perfect connected matchings

Mathematics Subject Classification ID

Hypergraphs (05C65) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Related Items (28)

Ramsey number of paths and connected matchings in Ore-type host graphs ⋮ Star Versus Two Stripes Ramsey Numbers and a Conjecture of Schelp ⋮ A proof of a conjecture of Gyárfás, Lehel, Sárközy and Schelp on Berge-cycles ⋮ Hamiltonian paths and cycles in some 4-uniform hypergraphs ⋮ Monochromatic Hamiltonian Berge-cycles in colored hypergraphs ⋮ Partitioning infinite hypergraphs into few monochromatic Berge-paths ⋮ Long monochromatic Berge cycles in colored 4-uniform hypergraphs ⋮ Cover \(k\)-uniform hypergraphs by monochromatic loose paths ⋮ On Berge-Ramsey problems ⋮ On Ramsey numbers of 3-uniform Berge cycles ⋮ Monochromatic Hamiltoniant-tight Berge-cycles in hypergraphs ⋮ A recursive formula for the reliability of a \(r\)-uniform complete hypergraph and its applications ⋮ Perfect matchings in shadow colorings ⋮ Monochromatic matchings in the shadow graph of almost complete hypergraphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ A note on Ramsey numbers for Berge-\(G\) hypergraphs ⋮ Partitioning 2-edge-colored graphs by monochromatic paths and cycles ⋮ Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs ⋮ A note on saturation for Berge-\(G\) hypergraphs ⋮ Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs ⋮ Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs ⋮ Ramsey numbers of Berge-hypergraphs and related structures ⋮ Partitioning 2-Edge-Colored Ore-Type Graphs by Monochromatic Cycles ⋮ The 3-Colour Ramsey Number of a 3-Uniform Berge Cycle ⋮ Ramsey Problems for Berge Hypergraphs ⋮ Matchings with few colors in colored complete graphs and hypergraphs ⋮ Ramsey Number of a Connected Triangle Matching ⋮ Multicolor Ramsey numbers for Berge cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Ramsey number for hypergraph cycles. I.
• A variant of the hypergraph removal lemma
• An improved bound for the monochromatic cycle partition number
• The Ramsey number for a triple of long even cycles
• The uniformity lemma for hypergraphs
• \(R(C_n,C_n,C_n)\leqq (4+o(1))n\)
• Blow-up lemma
• Three-color Ramsey numbers for paths
• Hypergraph regularity and the multidimensional Szemerédi theorem
• Tripartite Ramsey numbers for paths
• Regularity lemmas for hypergraphs and quasi-randomness
• An algorithmic version of the blow-up lemma
• Regularity Lemma for k-uniform hypergraphs

This page was built for publication: Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs