The size Ramsey number of trees with bounded degree
From MaRDI portal
Publication:4034710
DOI10.1002/rsa.3240040106zbMath0778.05060OpenAlexW2021319109WikidataQ105583222 ScholiaQ105583222MaRDI QIDQ4034710
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
Related Items (13)
Remarks on a paper by H. Bielak on size Ramsey numbers ⋮ The size‐Ramsey number of trees ⋮ The Induced Size-Ramsey Number of Cycles ⋮ The multicolour size-Ramsey number of powers of paths ⋮ The size Ramsey number of short subdivisions of bounded degree graphs ⋮ Size Ramsey numbers for some regular graphs ⋮ Size Ramsey numbers for some regular graphs ⋮ A note on the Size-Ramsey number of long subdivisions of graphs ⋮ The size-Ramsey number of trees ⋮ A note on the size Ramsey numbers for matchings versus cycles ⋮ The size‐Ramsey number of powers of bounded degree trees ⋮ The Size Ramsey Number of Graphs with Bounded Treewidth ⋮ The multicolor size-Ramsey numbers of cycles
Cites Work
This page was built for publication: The size Ramsey number of trees with bounded degree