Off-diagonal online size Ramsey numbers for paths
From MaRDI portal
Publication:6201874
DOI10.1016/j.ejc.2023.103873arXiv2310.09377OpenAlexW4388792585MaRDI QIDQ6201874
Publication date: 26 March 2024
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2310.09377
Games involving graphs (91A43) Generalized Ramsey theory (05C55) Ramsey theory (05D10) Games on graphs (graph-theoretic aspects) (05C57)
Cites Work
- Unnamed Item
- Unnamed Item
- On-line Ramsey numbers of paths and cycles
- A strengthening of the Erdős-Szekeres theorem
- On-line size Ramsey number for monotone \(k\)-uniform ordered paths with uniform looseness
- On induced online Ramsey number of paths, cycles, and trees
- On size Ramsey number of paths, trees, and circuits. I
This page was built for publication: Off-diagonal online size Ramsey numbers for paths