Coloring number and on-line Ramsey theory for graphs and hypergraphs

DOI10.1007/s00493-009-2264-1OpenAlexW2005870935MaRDI QIDQ2149488

Goran Konjevod, Henry A. Kierstead

Publication date: 29 June 2022

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-009-2264-1

Mathematics Subject Classification ID

Hypergraphs (05C65) Generalized Ramsey theory (05C55) Model theory of finite structures (03C13) Ramsey theory (05D10) Computability and recursion theory (03D99)

Related Items

On the computational complexity and strategies of online Ramsey theory ⋮ Online Ramsey theory for planar graphs ⋮ Bounds on Ramsey games via alterations ⋮ On-line size Ramsey number for monotone \(k\)-uniform ordered paths with uniform looseness ⋮ On-line Ramsey numbers of paths and cycles ⋮ Additive coloring of planar graphs

Cites Work

• Unnamed Item
• The size Ramsey number
• On-line Ramsey theory
• Two variants of the size Ramsey number