The size Ramsey number of short subdivisions of bounded degree graphs

DOI10.1002/RSA.20783zbMATHOpenAlexWikidataMaRDI QIDQ4633320FDO

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

zbMATH Keywords

regularity methodrandom graphsprobabilistic methodssize-Ramsey numberssubdivisions of graphs

Mathematics Subject Classification ID

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)

Recommendations

• The size‐Ramsey number of short subdivisions
• Generalized Ramsey Numbers Involving Subdivision Graphs, And Related Problems in Graph Theory
• A note on the Size-Ramsey number of long subdivisions of graphs
• Subdivided graphs have linear ramsey numbers
• Anti-Ramsey numbers of subdivided graphs

Cites work

• scientific article; zbMATH DE number 16104 (Why is no real title available?)
• scientific article; zbMATH DE number 1944144 (Why is no real title available?)
• scientific article; zbMATH DE number 1943962 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• scientific article; zbMATH DE number 2119679 (Why is no real title available?)
• An alternative proof of the linearity of the size-Ramsey number of paths
• Asymptotic Size Ramsey Results for Bipartite Graphs
• Expanding graphs contain all small trees
• Hall's theorem for hypergraphs
• On size Ramsey number of paths, trees, and circuits. I
• On size Ramsey numbers of graphs with bounded degree
• On the combinatorial problems which I would most like to see solved
• Path Ramsey number for random graphs
• Paths in graphs
• Recent developments in graph Ramsey theory
• Size ramsey numbers of stars versus 4‐chromatic graphs
• Small subsets inherit sparse \(\varepsilon\)-regularity
• Sparse partition universal graphs for graphs of bounded degree
• Szemerédi's regularity Lemma for matrices and sparse graphs
• Szemerédi’s Regularity Lemma for Sparse Graphs
• The Induced Size-Ramsey Number of Cycles
• The Ramsey size number of dipaths
• The size Ramsey number
• The size Ramsey number of trees with bounded degree
• The size-Ramsey number of trees
• The size-Ramsey number of trees
• The sparse regularity lemma and its applications

Cited in

(14)

• The size-Ramsey number of powers of bounded degree trees
• Divisible subdivisions
• The Size Ramsey Number of Graphs with Bounded Treewidth
• A note on Ramsey size-linear graphs
• The size‐Ramsey number of short subdivisions
• Size Gallai-Ramsey number
• Lower bounds of size Ramsey number for graphs with small independence number
• The size-Ramsey number of powers of bounded degree trees
• The multicolour size-Ramsey number of powers of paths
• Generalized Ramsey Numbers Involving Subdivision Graphs, And Related Problems in Graph Theory
• Size Ramsey number of bounded degree graphs for games
• Subdivided graphs have linear ramsey numbers
• Rolling backwards can move you forward: on embedding problems in sparse expanders
• A note on the Size-Ramsey number of long subdivisions of graphs

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)