The size Ramsey number of trees with bounded degree
From MaRDI portal
Publication:4034710
DOI10.1002/RSA.3240040106zbMATH Open0778.05060OpenAlexW2021319109WikidataQ105583222 ScholiaQ105583222MaRDI QIDQ4034710FDOQ4034710
Authors: Xin Ke 
Publication date: 16 May 1993
Published in: Random Structures \& Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.3240040106
Recommendations
Cites Work
Cited In (24)
- The vertex size-Ramsey number
- Two-edge colorings of graphs with bounded degree in both colors
- Degree Ramsey numbers of closed blowups of trees
- Degree Ramsey numbers for cycles and blowups of trees
- The size-Ramsey number of trees
- On size Ramsey numbers of graphs with bounded degree
- Remarks on a paper by H. Bielak on size Ramsey numbers
- The size-Ramsey number of powers of bounded degree trees
- An upper bound on the Ramsey number of trees
- Ramsey numbers for trees of small maximum degree
- The size Ramsey number of short subdivisions of bounded degree graphs
- The size-Ramsey number of trees
- An anti-Ramsey condition on trees
- Size Ramsey numbers for some regular graphs
- Size Ramsey numbers for some regular graphs
- The size-Ramsey number of powers of bounded degree trees
- A note on the Size-Ramsey number of long subdivisions of graphs
- The multicolor size-Ramsey numbers of cycles
- A note on the size Ramsey numbers for matchings versus cycles.
- The Size Ramsey Number of Graphs with Bounded Treewidth
- The multicolour size-Ramsey number of powers of paths
- On the Ramsey numbers of trees with small diameter
- The Induced Size-Ramsey Number of Cycles
- On bounded degree graphs with large size-Ramsey numbers
This page was built for publication: The size Ramsey number of trees with bounded degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4034710)
