Trees with an on-line degree Ramsey number of four
The electronic journal of combinatorics, Tome 18 (2011) no. 1
On-line Ramsey theory studies a graph-building game between two players. The player called Builder builds edges one at a time, and the player called Painter paints each new edge red or blue after it is built. The graph constructed is called the background graph. Builder's goal is to cause the background graph to contain a monochromatic copy of a given goal graph, and Painter's goal is to prevent this. In the $S_k$-game variant of the typical game, the background graph is constrained to have maximum degree no greater than $k$. The on-line degree Ramsey number $\mathring{R}_{\Delta}(G)$ of a graph $G$ is the minimum $k$ such that Builder wins an $S_k$-game in which $G$ is the goal graph. Butterfield et al. previously determined all graphs $G$ satisfying $\mathring{R}_{\Delta}(G)\le 3$. We provide a complete classification of trees $T$ satisfying $\mathring{R}_{\Delta}(T)=4$.
@article{10_37236_660,
author = {David Rolnick},
title = {Trees with an on-line degree {Ramsey} number of four},
journal = {The electronic journal of combinatorics},
year = {2011},
volume = {18},
number = {1},
doi = {10.37236/660},
zbl = {1230.05209},
url = {http://geodesic.mathdoc.fr/articles/10.37236/660/}
}
David Rolnick. Trees with an on-line degree Ramsey number of four. The electronic journal of combinatorics, Tome 18 (2011) no. 1. doi: 10.37236/660
Cité par Sources :