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

DOI10.1007/S00493-009-2264-1OpenAlexW2005870935MaRDI QIDQ2149488FDOQ2149488

H. A. Kierstead, Goran Konjevod

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

Recommendations

• On-line Ramsey theory
• On-line Ramsey Numbers
• On the computational complexity and strategies of online Ramsey theory
• On-line Ramsey numbers for paths and short cycles
• The game chromatic number of a random hypergraph

Mathematics Subject Classification ID

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

Cites Work

• The size Ramsey number
• On-line Ramsey theory
• Two variants of the size Ramsey number
• Title not available (Why is that?)

Cited In (6)

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

This page was built for publication: Coloring number and on-line Ramsey theory for graphs and hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2149488)