Answers are grounded in this paper and cite their sources.
In the coloring game on a finite graph, Alice and Bob alternately color uncolored vertices with one of k colors so that adjacent vertices get different colors. Alice moves first and wins if every vertex gets colored; Bob wins if some uncolored vertex sees all k colors among its neighbors. The game chromatic number of a graph is the least k for which Alice can force a win. We prove that for every K there is d such that every graph of average degree at least d has a subgraph on which Bob wins the k-color game for every k≤ K. Consequently, if a class of graphs is closed under taking subgraphs and its game chromatic numbers are bounded, then the edges of each of its graphs can be partitioned into a bounded number of forests, that is, the class has bounded arboricity. This answers Zhu's Question 3 (1999) in the affirmative. The proof combines the theorem of Kühn and Osthus that every graph of large enough average degree contains a subgraph of large average degree with no 4-cycle, with a strategy for Bob that adapts the weighting argument behind Beck's criterion for positional games: Bob uses weights to keep some uncolored vertex that can still be blocked from every color. The rest of the proof is checked in Lean, with the theorem of Kühn and Osthus as an explicit hypothesis. This work has not yet been reviewed by experts. The proofs, the Lean formalization and the text were produced by AI models (from OpenAI and Anthropic), working under the author's direction. Written proof, with Lean and computer checks; not yet reviewed by experts. Produced by AI models under the author's direction.
No takes yet. Share an insight, caveat, or question.
P. Graham (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: