Answers are grounded in this paper and cite their sources.
Randomized game explores winning strategies in multipartite graphs, indicating complexity with singletons.
The coloring game is a two-player non-cooperative game conceived in 1981. Alice and Bob alternate turns to properly color the vertices of a finite, simple, undirected, and connected graph G with t colors. Alice's goal is to properly color the vertices of G with t colors; Bob's aim is to prevent it. If, at any point, there is an uncolored vertex without an available color, Bob wins; otherwise, Alice wins. The game chromatic number χ g ( G ) is the smallest t for Alice to have a winning strategy. Motivated by the study of Obszarski et al. (2023) in complete multipartite graphs with no singleton parts, we contribute to the understanding of the difficulty of allowing singleton parts in the complete multipartite graph and obtain surprising results even if we allow just one singleton part.
No takes yet. Share an insight, caveat, or question.
Furtado et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: