Matchings with few colors in colored complete graphs and hypergraphs

DOI10.1016/j.disc.2020.111831zbMath1435.05139OpenAlexW3000837127WikidataQ126302767 ScholiaQ126302767MaRDI QIDQ2305937

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

Publication date: 20 March 2020

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2020.111831

zbMATH Keywords

Ramsey theorymatchings

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Related Items (2)

The (t−1) $(t-1)$‐chromatic Ramsey number for paths ⋮ An improvement on Łuczak's connected matchings method

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Coverings by few monochromatic pieces: a transition between two Ramsey problems
• Partitioning 3-colored complete graphs into three monochromatic cycles
• An improved bound for the monochromatic cycle partition number
• The Ramsey number for a triple of long even cycles
• The Ramsey number of diamond-matchings and loose cycles in hypergraphs
• A short proof of Kneser's conjecture
• \(R(C_n,C_n,C_n)\leqq (4+o(1))n\)
• Blow-up lemma
• A combinatorical proof of Kneser's conjecture
• Large 2-coloured matchings in 3-coloured complete hypergraphs
• Three-color Ramsey numbers for paths
• Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs
• Star Versus Two Stripes Ramsey Numbers and a Conjecture of Schelp
• The Chromatic Number of Kneser Hypergraphs
• The Ramsey number for stripes
• An algorithmic version of the blow-up lemma
• A New Short Proof of Kneser's Conjecture
• Spanning Trees with Few Branch Vertices
• The 1-Factors of Oriented Graphs

This page was built for publication: Matchings with few colors in colored complete graphs and hypergraphs