A note on restricted online Ramsey numbers of matchings

DOI10.37236/10025zbMath1470.05114arXiv2010.04113OpenAlexW3183984679MaRDI QIDQ2048542

Vojtěch Dvořák

Publication date: 6 August 2021

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2010.04113

zbMATH Keywords

lower bound for Ramsey numbers

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Generalized Ramsey theory (05C55) Ramsey theory (05D10) Games on graphs (graph-theoretic aspects) (05C57)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On-line Ramsey numbers of paths and cycles
• \(R(3,4)=17\)
• On-line Ramsey numbers for paths and short cycles
• Restricted online Ramsey numbers of matchings and trees
• An upper bound for the restricted online Ramsey number
• On-line Ramsey Numbers
• Recent developments in graph Ramsey theory
• Online Ramsey Numbers and the Subgraph Query Problem
• A note on on-line Ramsey numbers for quadrilaterals
• The Ramsey number for stripes
• Two variants of the size Ramsey number

This page was built for publication: A note on restricted online Ramsey numbers of matchings