Online size Ramsey numbers: odd cycles vs connected graphs
From MaRDI portal
Publication:6614169
DOI10.37236/11644zbMATH Open1548.05234MaRDI QIDQ6614169
Grzegorz Adamski, Małgorzata Bednarska-Bzdȩga
Publication date: 7 October 2024
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Games involving graphs (91A43) Structural characterization of families of graphs (05C75) 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
- Size-Ramsey numbers of cycles versus a path
- On-line Ramsey numbers for paths and short cycles
- On induced online Ramsey number of paths, cycles, and trees
- On the size Ramsey number of all cycles versus a path
- On-line Ramsey Numbers
- Two variants of the size Ramsey number
- Size Ramsey numbers of stars versus 3-chromatic graphs
Related Items (3)
Online Ramsey numbers of ordered paths and cycles ⋮ Online size Ramsey numbers: path vs \(C_4\) ⋮ Online Ramsey numbers: long versus short cycles
This page was built for publication: Online size Ramsey numbers: odd cycles vs connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6614169)
