The Size Ramsey Number of Graphs with Bounded Treewidth
From MaRDI portal
Publication:5854459
DOI10.1137/20M1335790zbMath1459.05201arXiv1906.09185OpenAlexW3135732667MaRDI QIDQ5854459
David R. Wood, Anita Liebenau, Nina Kamčev, Liana Yepremyan
Publication date: 17 March 2021
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1906.09185
Trees (05C05) Generalized Ramsey theory (05C55) Ramsey theory (05D10) Density (toughness, etc.) (05C42)
Related Items (4)
The size‐Ramsey number of cubic graphs ⋮ Unnamed Item ⋮ Ramsey Goodness of Clique Versus Paths in Random Graphs ⋮ The multicolor size-Ramsey numbers of cycles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ramsey goodness of paths
- On globally sparse Ramsey graphs
- Degree Ramsey numbers of closed blowups of trees
- What is Ramsey-equivalent to a clique?
- Degree Ramsey numbers for cycles and blowups of trees
- On tree-partition-width
- Multipartite graph-sparse graph Ramsey numbers
- Expanding graphs contain all small trees
- Explicit construction of linear sized tolerant networks
- On the combinatorial problems which I would most like to see solved
- The Ramsey property for graphs with forbidden complete subgraphs
- The size Ramsey number
- A partial k-arboretum of graphs with bounded treewidth
- Partitioning graphs of bounded tree-width
- Chromatic Ramsey numbers
- The multicolour size-Ramsey number of powers of paths
- Ramsey-goodness -- and otherwise
- Parameters Tied to Treewidth
- On the minimum degree of minimal Ramsey graphs
- The minimum degree of Ramsey-minimal graphs
- A proof of Alon’s second eigenvalue conjecture and related problems
- The size Ramsey number of trees with bounded degree
- On size Ramsey number of paths, trees, and circuits. I
- Some results on tree decomposition of graphs
- The Induced Size-Ramsey Number of Cycles
- The size‐Ramsey number of powers of bounded degree trees
- Ramsey Goodness of Cycles
- The size‐Ramsey number of powers of paths
- An Alternative Proof of the Linearity of the Size-Ramsey Number of Paths
- Short Proofs of Some Extremal Results
- Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
- On a problem of K. Zarankiewicz
- The size‐Ramsey number of trees
- 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 Graphs with Bounded Treewidth