Saturation Games for Odd Cycles
Sam Spiro

TL;DR
This paper investigates the $$-saturation game for odd cycles, establishing bounds on the maximum number of edges in the final graph when two players play optimally, extending understanding of saturation games for odd cycle families.
Contribution
It generalizes the $$-saturation game to families of odd cycles and provides bounds on the final graph's edge count for these families, advancing the theoretical understanding of saturation games.
Findings
Established lower bounds for $sat_g(; n)$ for families of odd cycles.
Provided upper bounds on $sat_g(; n)$ for specific odd cycle families.
Connected the bounds to the size of the odd cycle family and asymptotic behavior.
Abstract
Given a family of graphs , we consider the -saturation game. In this game two players alternate adding edges to an initially empty graph on vertices, with the only constraint being that neither player can add an edge that creates a subgraph that lies in . The game ends when no more edges can be added to the graph. One of the players wishes to end the game as quickly as possible, while the other wishes to prolong the game. We let denote the number of edges that are in the final graph when both players play optimally. The -saturation game was the first saturation game to be considered, but as of now the order of magnitude of remains unknown. We consider a generalization of this game. Let . We prove that…
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 · Markov Chains and Monte Carlo Methods
