Ramsey numbers of path-matchings, covering designs, and 1-cores

DOI10.1016/j.jctb.2020.09.004zbMath1457.05066arXiv1909.01920OpenAlexW3087152165MaRDI QIDQ2221922

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

Publication date: 3 February 2021

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

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

zbMATH Keywords

linear forestscovering designsgraph-Ramsey theory

Mathematics Subject Classification ID

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

Related Items (1)

Discrepancies of spanning trees and Hamilton cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matching theory
• An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
• Ramsey numbers for all linear forests
• An extension of Tutte's 1-factor theorem
• Matchings and covers in hypergraphs
• On Ramsey numbers for linear forests
• On coverings
• Structural results on maximal k-degenerate graphs
• Large Monochromatic Components in Edge Colorings of Graphs: A Survey
• The Ramsey number for stripes

This page was built for publication: Ramsey numbers of path-matchings, covering designs, and 1-cores