The size‐Ramsey number of short subdivisions
From MaRDI portal
Publication:6074649
DOI10.1002/rsa.20995zbMath1522.05484arXiv2004.14139OpenAlexW3125402912MaRDI QIDQ6074649
Michael Krivelevich, Nemanja Draganić, Rajko Nenadov
Publication date: 12 October 2023
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.14139
Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30) Generalized Ramsey theory (05C55) Ramsey theory (05D10)
Related Items (4)
Rolling backwards can move you forward: On embedding problems in sparse expanders ⋮ The size‐Ramsey number of cubic graphs ⋮ Divisible subdivisions ⋮ Tight bounds for divisible subdivisions
Cites Work
- Unnamed Item
- Unnamed Item
- Small subsets inherit sparse \(\varepsilon\)-regularity
- Expanding graphs contain all small trees
- The size Ramsey number
- Note on the multicolour size-Ramsey number for paths
- The multicolour size-Ramsey number of powers of paths
- Long cycles in locally expanding graphs, with applications
- Recent developments in graph Ramsey theory
- The size Ramsey number of short subdivisions of bounded degree graphs
- A note on the Size-Ramsey number of long subdivisions of graphs
- On size Ramsey number of paths, trees, and circuits. I
- Paths in graphs
- 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 trees
- On size Ramsey numbers of graphs with bounded degree
This page was built for publication: The size‐Ramsey number of short subdivisions
