Colorability Saturation Games
Ralph Keusch

TL;DR
This paper analyzes a two-player graph game where players add edges to maximize or minimize the final number of edges without exceeding a given chromatic number, providing bounds and detailed results for specific cases.
Contribution
The paper improves bounds on the score of colorability saturation games for all parameters and offers a detailed analysis for the case when k=4.
Findings
Established almost matching bounds on the game score for arbitrary n and k.
Proved the score for the case k=4 is approximately n^2/3 with lower order terms.
Extended understanding of saturation games in graph theory.
Abstract
We consider the following two-player game: Maxi and Mini start with the empty graph on vertices and take turns, always adding one additional edge to the graph such that the chromatic number is at most , where is a given parameter. The game is over when the graph is saturated and no further edge can be inserted. Maxi wants to maximize the length of the game while Mini wants to minimize it. The score denotes the number of edges in the final graph, given that both players followed an optimal strategy. This colorability game belongs to the family of \emph{saturation games} that are known to provide beautiful and challenging problems despite being defined via simple combinatorial rules. The analysis of colorability saturation games has been initiated recently by Hefetz, Krivelevich, Naor, and Stojakovi\'c (2016). In this paper, we improve their…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Advanced Graph Theory Research · Graph Labeling and Dimension Problems
