On the Size-Ramsey Number of Cycles
From MaRDI portal
Publication:5222561
DOI10.1017/S0963548319000221zbMath1436.05073arXiv1701.07348OpenAlexW2963958519MaRDI QIDQ5222561
No author found.
Publication date: 6 April 2020
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1701.07348
Related Items (10)
On the size-Ramsey number of grid graphs ⋮ On the size Ramsey number of all cycles versus a path ⋮ On the restricted size Ramsey number involving a path \(P_3\) ⋮ The size‐Ramsey number of short subdivisions ⋮ Turán‐type problems for long cycles in random and pseudo‐random graphs ⋮ On the restricted size Ramsey number for a pair of cycles ⋮ Lower bounds of size Ramsey number for graphs with small independence number ⋮ Size-Ramsey numbers of cycles versus a path ⋮ Size Ramsey number of bipartite graphs and bipartite Ramanujan graphs ⋮ The multicolor size-Ramsey numbers of cycles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The size Ramsey number
- Small Ramsey numbers
- Recent developments in graph Ramsey theory
- Ramsey Goodness of Bounded Degree Trees
- On size Ramsey number of paths, trees, and circuits. I
- The Induced Size-Ramsey Number of Cycles
- On some Multicolor Ramsey Properties of Random Graphs
- An Alternative Proof of the Linearity of the Size-Ramsey Number of Paths
- Path Ramsey Number for Random Graphs
- The size-Ramsey number of trees
This page was built for publication: On the Size-Ramsey Number of Cycles