Online Ramsey numbers: long versus short cycles
From MaRDI portal
Publication:6654127
DOI10.1137/23m156183xMaRDI QIDQ6654127
Grzegorz Adamski, Václav Blažej, Małgorzata Bednarska-Bzdȩga
Publication date: 18 December 2024
Published in: SIAM Journal on Discrete Mathematics (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?)
- All Ramsey numbers for cycles in graphs
- The size Ramsey number
- On induced online Ramsey number of paths, cycles, and trees
- Ramsey numbers for cycles in graphs
- On a Ramsey-type problem of J. A. Bondy and P. Erdős. I
- On a Ramsey-type problem of J. A. Bondy and P. Erdős. II
- On-line Ramsey Numbers
- Online Ramsey Numbers and the Subgraph Query Problem
- The Induced Size-Ramsey Number of Cycles
- On the Size-Ramsey Number of Cycles
- On the restricted size Ramsey number for a pair of cycles
- Online size Ramsey numbers: path vs \(C_4\)
- Online size Ramsey numbers: odd cycles vs connected graphs
This page was built for publication: Online Ramsey numbers: long versus short cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6654127)
