On induced online Ramsey number of paths, cycles, and trees
From MaRDI portal
Publication:2330552
DOI10.1007/978-3-030-19955-5_6OpenAlexW2963843924MaRDI QIDQ2330552FDOQ2330552
Authors: Václav Blažej, Pavel Dvořák, T. Valla 
Publication date: 22 October 2019
Full work available at URL: https://arxiv.org/abs/1901.03671
Recommendations
- On-line Ramsey numbers of paths and cycles
- On-line Ramsey numbers for paths and short cycles
- Restricted online Ramsey numbers of matchings and trees
- scientific article; zbMATH DE number 5247083
- On-line Ramsey theory for bounded degree graphs
- A note on on-line Ramsey numbers of stars and paths
- Online Ramsey theory for planar graphs
- Online Ramsey numbers and the subgraph query problem
- On-line Ramsey numbers for paths and stars
- scientific article
Cited In (10)
- On Induced Online Ramsey Number of Paths, Cycles, and Trees
- The asymptotic of off-diagonal online Ramsey numbers for paths
- Online size Ramsey numbers: path vs \(C_4\)
- Online size Ramsey numbers: odd cycles vs connected graphs
- A strengthening of the Erdős-Szekeres theorem
- Off-diagonal online size Ramsey numbers for paths
- Title not available (Why is that?)
- On-line Ramsey numbers of paths and cycles
- Online Ramsey numbers: long versus short cycles
- Online Ramsey numbers of ordered paths and cycles
This page was built for publication: On induced online Ramsey number of paths, cycles, and trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2330552)
