Monochromatic coverings and tree Ramsey numbers

DOI10.1016/0012-365X(94)90179-1zbMath0795.05096OpenAlexW1991179333MaRDI QIDQ1322294

Zsolt Tuza

Publication date: 5 May 1994

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

Full work available at URL: https://doi.org/10.1016/0012-365x(94)90179-1

zbMATH Keywords

Ramsey numberscoveringscomplete graph

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 (1)

Generalizations and strengthenings of Ryser's conjecture

Cites Work

• Multipartite Turán problem for connected graphs and hypergraphs
• On generalized Ramsey numbers for trees
• Maximum degree and fractional matchings in uniform hypergraphs
• An upper bound on the Ramsey number of trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Monochromatic coverings and tree Ramsey numbers