On canonical Ramsey numbers for complete graphs versus paths

DOI10.1006/jctb.1993.1025zbMath0794.05088OpenAlexW2039332791MaRDI QIDQ1325270

Vojtěch Rödl, Hanno Lefmann

Publication date: 28 August 1994

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

Full work available at URL: https://doi.org/10.1006/jctb.1993.1025

zbMATH Keywords

upper boundRamsey numberlower boundpathcoloringRamsey graphscanonization type problemsErdős-Rado canonization numbers

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Related Items (6)

Ordered and canonical Ramsey numbers of stars ⋮ Rainbow generalizations of Ramsey theory: A survey ⋮ Combinatorial unprovability proofs and their model-theoretic counterparts ⋮ A General Framework for Studying Finite Rainbow Configurations ⋮ Regressive Ramsey numbers are Ackermannian ⋮ On Erdős-Rado numbers

This page was built for publication: On canonical Ramsey numbers for complete graphs versus paths