The size‐Ramsey number of trees
From MaRDI portal
Publication:5894526
DOI10.1002/rsa.20363zbMath1236.05128WikidataQ105583212 ScholiaQ105583212MaRDI QIDQ5894526
Publication date: 7 March 2012
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.20363
Related Items
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 Graphs with Bounded Treewidth, The vertex size-Ramsey number, The multicolour size-Ramsey number of powers of paths, Lower bounds of size Ramsey number for graphs with small independence number, Degree Ramsey numbers for even cycles
Cites Work
- Unnamed Item
- Unnamed Item
- Expanding graphs contain all small trees
- The size Ramsey number
- The size Ramsey number of trees with bounded degree
- On size Ramsey number of paths, trees, and circuits. I
- Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators
- The size-Ramsey number of trees
- On size Ramsey numbers of graphs with bounded degree