Subdivided graphs have linear ramsey numbers
From MaRDI portal
Recommendations
Cited in
(20)- On the Ramsey number of sparse 3-graphs
- Fraternal augmentations, arrangeability and linear Ramsey numbers
- Ramsey linear families and generalized subdivided graphs
- Anti-Ramsey numbers of subdivided graphs
- Deciding and verifying network properties locally with few output bits
- On 1-subdivisions of transitive tournaments
- Ramsey number of 1-subdivisions of transitive tournaments
- On graphs with small Ramsey numbers
- A note on Ramsey size-linear graphs
- Hypergraph packing and sparse bipartite Ramsey numbers
- Generalized Ramsey Numbers Involving Subdivision Graphs, And Related Problems in Graph Theory
- On graphs with linear Ramsey numbers
- The size Ramsey number of short subdivisions of bounded degree graphs
- A note on the Size-Ramsey number of long subdivisions of graphs
- On the extremal number of subdivisions
- Rolling backwards can move you forward: on embedding problems in sparse expanders
- The size‐Ramsey number of short subdivisions
- On Ramsey Size-Linear Graphs and Related Questions
- Immersions of directed graphs in tournaments
- On Ramsey numbers of uniform hypergraphs with given maximum degree
This page was built for publication: Subdivided graphs have linear ramsey numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4297820)
