On-line Ramsey theory for bounded degree graphs
From MaRDI portal
Publication:551227
zbMath1225.05179MaRDI QIDQ551227
Douglas B. West, Christopher Stocker, Tracy Grauman, William B. Kinnersley, Kevin G. Milans, Jane V. Butterfield
Publication date: 15 July 2011
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/226131
Related Items (11)
On the computational complexity and strategies of online Ramsey theory ⋮ Bounds on the game transversal number in hypergraphs ⋮ Domination Game: A proof of the $3/5$-Conjecture for Graphs with Minimum Degree at Least Two ⋮ Paired-Domination Game Played in Graphs ⋮ Online Ramsey games for triangles in random graphs ⋮ The on-line degree Ramsey number of cycles ⋮ Online Ramsey theory for planar graphs ⋮ On-line size Ramsey number for monotone \(k\)-uniform ordered paths with uniform looseness ⋮ A note on on-line Ramsey numbers of stars and paths ⋮ Transversal Game on Hypergraphs and the $\frac{3}{4}$-Conjecture on the Total Domination Game ⋮ Coloring random graphs online without creating monochromatic subgraphs
This page was built for publication: On-line Ramsey theory for bounded degree graphs
