Off-diagonal online size Ramsey numbers for paths

DOI10.1016/J.EJC.2023.103873arXiv2310.09377OpenAlexW4388792585MaRDI QIDQ6201874FDOQ6201874

Authors: Małgorzata Bednarska-Bzdȩga 

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

zbMATH Keywords

Ramsey game

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43) Ramsey theory (05D10)

Cites Work

• On size Ramsey number of paths, trees, and circuits. I
• On-line Ramsey numbers for paths and stars
• On induced online Ramsey number of paths, cycles, and trees
• A note on off-diagonal small on-line Ramsey numbers for paths.
• 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

Cited In (2)

• The asymptotic of off-diagonal online Ramsey numbers for paths
• Online Ramsey numbers of ordered paths and cycles

This page was built for publication: Off-diagonal online size Ramsey numbers for paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6201874)