Online size Ramsey number for $C_4$ and $P_6$
Mateusz Litka

TL;DR
This paper determines the exact online size Ramsey number for the pair of graphs $C_4$ and $P_6$, showing that Builder can win in exactly 11 rounds when both players play optimally.
Contribution
The paper refines previous bounds and proves the exact value of the online size Ramsey number for $C_4$ and $P_6$, which was previously known only within bounds.
Findings
Established that $ ilde{r}(C_4,P_6)=11$
Improved understanding of online size Ramsey numbers for specific graph pairs
Provided detailed proof of the exact number
Abstract
In this paper we consider a game played on the edge set of the infinite clique by two players, Builder and Painter. In each round of the game, Builder chooses an edge and Painter colors it red or blue. Builder wins when Painter creates a red copy of or a blue copy of , for some fixed graphs and . Builder wants to win in as few rounds as possible, and Painter wants to delay Builder for as many rounds as possible. The online size Ramsey number , is the minimum number of rounds within which Builder can win, assuming both players play optimally. So far it has been proven by Dybizba\'nski, Dzido and Zakrzewska that \cite{Dzido}. In this paper, we refine this result and show the exact value, namely we will present the Theorem that , with the details of the proof. Keywords: graph theory,…
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 Topology and Set Theory · Computability, Logic, AI Algorithms
