The asymptotic of off-diagonal online Ramsey numbers for paths
From MaRDI portal
Publication:6612302
DOI10.1016/J.EJC.2024.104032zbMATH Open1548.05232MaRDI QIDQ6612302
Publication date: 30 September 2024
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Games involving graphs (91A43) Paths and cycles (05C38) Generalized Ramsey theory (05C55) Ramsey theory (05D10) Combinatorial games (91A46) Games on graphs (graph-theoretic aspects) (05C57)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- A note on off-diagonal small on-line Ramsey numbers for paths.
- On size Ramsey number of paths, trees, and circuits. I
- Two variants of the size Ramsey number
- Off-diagonal online size Ramsey numbers for paths
Related Items (1)
This page was built for publication: The asymptotic of off-diagonal online Ramsey numbers for paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6612302)
