Size-Ramsey numbers of structurally sparse graphs
From MaRDI portal
Cites work
- A Separator Theorem for Nonplanar Graphs
- Bisection of Circle Colorings
- Expanding graphs contain all small trees
- Graph minors. II. Algorithmic aspects of tree-width
- scientific article; zbMATH DE number 16297 (Why is no real title available?)
- scientific article; zbMATH DE number 2086426 (Why is no real title available?)
- On a problem of formal logic.
- On size Ramsey number of paths, trees, and circuits. I
- On size Ramsey numbers of graphs with bounded degree
- On the size-Ramsey number of grids
- On tree-partition-width
- Ramsey numbers of degenerate graphs
- Rolling backwards can move you forward: on embedding problems in sparse expanders
- Small subsets inherit sparse \(\varepsilon\)-regularity
- Some results on tree decomposition of graphs
- Sparse partition universal graphs for graphs of bounded degree
- The Ramsey number of a graph with bounded maximum degree
- The size Ramsey number
- The Size Ramsey Number of Graphs with Bounded Treewidth
- The size Ramsey number of short subdivisions of bounded degree graphs
- The size-Ramsey number of powers of bounded degree trees
- The size‐Ramsey number of short subdivisions
- The sparse regularity lemma and its applications
- Treewidth of graphs with balanced separations
- Universal Graphs for Bounded-Degree Trees and Planar Graphs
This page was built for publication: Size-Ramsey numbers of structurally sparse graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7227401)