Ramsey numbers for trees of small maximum degree

DOI10.1007/s004930200014zbMath0997.05065OpenAlexW2016667694MaRDI QIDQ1848150

Tomasz Łuczak, Peter Tingley, Penny E. Haxell

Publication date: 3 November 2002

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004930200014

zbMATH Keywords

regularity lemmaRamsey numbers of treesBurr's conjecture

Mathematics Subject Classification ID

Trees (05C05) Generalized Ramsey theory (05C55)

Related Items (10)

A version of the Loebl-Komlós-Sós conjecture for skew trees ⋮ A skew version of the Loebl-Komlós-Sós conjecture ⋮ Loebl-Komlós-Sós conjecture: dense case ⋮ Three-Color Bipartite Ramsey Number for Graphs with Small Bandwidth ⋮ An approximate version of the Loebl-Komlós-Sós conjecture ⋮ A note on the Size-Ramsey number of long subdivisions of graphs ⋮ The tripartite Ramsey number for trees ⋮ Ramsey numbers for bipartite graphs with small bandwidth ⋮ The Approximate Loebl--Komlós--Sós Conjecture I: The Sparse Decomposition ⋮ The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs

This page was built for publication: Ramsey numbers for trees of small maximum degree