The size Ramsey number of short subdivisions of bounded degree graphs
DOI10.1002/RSA.20783zbMATH Open1409.05136OpenAlexW2884508814WikidataQ102054499 ScholiaQ102054499MaRDI QIDQ4633320FDOQ4633320
Authors: Yoshiharu Kohayakawa, Troy Retter, Vojtěch Rödl
Publication date: 2 May 2019
Published in: Random Structures \& Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.20783
Recommendations
Random graphs (graph-theoretic aspects) (05C80) Extremal problems in graph theory (05C35) Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)
Cites Work
- Title not available (Why is that?)
- Expanding graphs contain all small trees
- On the combinatorial problems which I would most like to see solved
- The size Ramsey number
- Title not available (Why is that?)
- Title not available (Why is that?)
- On size Ramsey number of paths, trees, and circuits. I
- Paths in graphs
- The Induced Size-Ramsey Number of Cycles
- An alternative proof of the linearity of the size-Ramsey number of paths
- The size-Ramsey number of trees
- On size Ramsey numbers of graphs with bounded degree
- Sparse partition universal graphs for graphs of bounded degree
- The size-Ramsey number of trees
- Szemerédi’s Regularity Lemma for Sparse Graphs
- Hall's theorem for hypergraphs
- Small subsets inherit sparse \(\varepsilon\)-regularity
- Szemerédi's regularity Lemma for matrices and sparse graphs
- The sparse regularity lemma and its applications
- Title not available (Why is that?)
- The size Ramsey number of trees with bounded degree
- The Ramsey size number of dipaths
- Path Ramsey number for random graphs
- Recent developments in graph Ramsey theory
- Title not available (Why is that?)
- Asymptotic Size Ramsey Results for Bipartite Graphs
- Size ramsey numbers of stars versus 4‐chromatic graphs
Cited In (14)
- A note on Ramsey size-linear graphs
- Lower bounds of size Ramsey number for graphs with small independence number
- The size‐Ramsey number of short subdivisions
- The size-Ramsey number of powers of bounded degree trees
- Rolling backwards can move you forward: on embedding problems in sparse expanders
- The size-Ramsey number of powers of bounded degree trees
- Generalized Ramsey Numbers Involving Subdivision Graphs, And Related Problems in Graph Theory
- A note on the Size-Ramsey number of long subdivisions of graphs
- Size Ramsey number of bounded degree graphs for games
- The Size Ramsey Number of Graphs with Bounded Treewidth
- The multicolour size-Ramsey number of powers of paths
- Size Gallai-Ramsey number
- Divisible subdivisions
- Subdivided graphs have linear ramsey numbers
This page was built for publication: The size Ramsey number of short subdivisions of bounded degree graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4633320)