The multicolor size-Ramsey numbers of cycles
From MaRDI portal
Publication:2101174
DOI10.1016/j.jctb.2022.10.003zbMath1502.05158arXiv2106.16023OpenAlexW4308308547MaRDI QIDQ2101174
Publication date: 28 November 2022
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.16023
Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38) Generalized Ramsey theory (05C55) Ramsey theory (05D10)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- The size Ramsey number of a directed path
- Expanding graphs contain all small trees
- On the combinatorial problems which I would most like to see solved
- The size Ramsey number
- Note on the multicolour size-Ramsey number for paths
- Monochromatic paths in random tournaments
- The Ramsey size number of dipaths
- Cycle lengths in expanding graphs
- The oriented size Ramsey number of directed paths
- The multicolour size-Ramsey number of powers of paths
- On some extremal problems in graph theory
- Long cycles in locally expanding graphs, with applications
- Ramsey numbers for cycles in graphs
- Local resilience of almost spanning trees in random graphs
- On the multi-colored Ramsey numbers of cycles
- The size Ramsey number of trees with bounded degree
- Ramsey Goodness of Bounded Degree Trees
- On size Ramsey number of paths, trees, and circuits. I
- The Induced Size-Ramsey Number of Cycles
- On the Size-Ramsey Number of Cycles
- The size‐Ramsey number of powers of paths
- 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 Graphs with Bounded Treewidth
- The size-Ramsey number of trees
- On size Ramsey numbers of graphs with bounded degree
- Color‐biased Hamilton cycles in random graphs
This page was built for publication: The multicolor size-Ramsey numbers of cycles
