On the computational complexity and strategies of online Ramsey theory

DOI10.1016/J.ENDM.2015.06.099MaRDI QIDQ322363zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Pavel Dvořák, T. Valla

Publication date 14 October 2016

Full work available at URL https://doi.org/10.1016/j.endm.2015.06.099

zbMATH Keywords

complexityonline Ramsey gamestrategy

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57) Hypergraphs (05C65) Ramsey theory (05D10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Games involving graphs (91A43)

Recommendations

• On-line Ramsey theory
• Coloring number and on-line Ramsey theory for graphs and hypergraphs
• Online Ramsey theory for planar graphs
• On-line Ramsey Numbers
• On-line Ramsey numbers for paths and short cycles

Cites work

• Coloring number and on-line Ramsey theory for graphs and hypergraphs
• Graph Ramsey theory and the polynomial hierarchy
• scientific article; zbMATH DE number 524119 (Why is no real title available?)
• On-line Ramsey Numbers
• On-line Ramsey theory
• On-line Ramsey theory for bounded degree graphs
• Online Ramsey theory for planar graphs
• Ramsey Games Against a One-Armed Bandit
• Trees with an on-line degree Ramsey number of four

Cited in

(5)

• On-line Ramsey theory
• A note on restricted online Ramsey numbers of matchings
• Coloring number and on-line Ramsey theory for graphs and hypergraphs
• Online Ramsey theory for planar graphs
• Graph Ramsey games

This page was built for publication: On the computational complexity and strategies of online Ramsey theory

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