Monochromatic matchings in the shadow graph of almost complete hypergraphs

DOI10.1007/S00026-010-0058-1zbMath1235.05051OpenAlexW2059402221MaRDI QIDQ659584

András Gyárfás, Gábor N. Sárközy

Publication date: 24 January 2012

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00026-010-0058-1

zbMATH Keywords

colored complete uniform hypergraphsmonochromatic matchings

Mathematics Subject Classification ID

Hypergraphs (05C65) 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 (8)

A proof of a conjecture of Gyárfás, Lehel, Sárközy and Schelp on Berge-cycles ⋮ Monochromatic Hamiltonian Berge-cycles in colored hypergraphs ⋮ Partitioning infinite hypergraphs into few monochromatic Berge-paths ⋮ Long monochromatic Berge cycles in colored 4-uniform hypergraphs ⋮ On Ramsey numbers of 3-uniform Berge cycles ⋮ Perfect matchings in shadow colorings ⋮ Monochromatic partitions in local edge colorings ⋮ Ramsey Problems for Berge Hypergraphs

Cites Work

• Unnamed Item
• The Ramsey number for hypergraph cycles. I.
• The Ramsey number for a triple of long even cycles
• \(R(C_n,C_n,C_n)\leqq (4+o(1))n\)
• Three-color Ramsey numbers for paths
• Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs
• The 3-Colour Ramsey Number of a 3-Uniform Berge Cycle
• The Ramsey Number for 3-Uniform Tight Hypergraph Cycles

This page was built for publication: Monochromatic matchings in the shadow graph of almost complete hypergraphs