The size-Ramsey number of trees
From MaRDI portal
Publication:5916315
DOI10.1007/BF02808204zbMath0822.05049WikidataQ105583369 ScholiaQ105583369MaRDI QIDQ5916315
Yoshiharu Kohayakawa, Penny E. Haxell
Publication date: 5 October 1995
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Related Items (20)
On the size-Ramsey number of grid graphs ⋮ Remarks on a paper by H. Bielak on size Ramsey numbers ⋮ On the minimum degree of minimal Ramsey graphs for multiple colours ⋮ The size‐Ramsey number of trees ⋮ Tree embeddings ⋮ Size Gallai-Ramsey number ⋮ The Induced Size-Ramsey Number of Cycles ⋮ The multicolour size-Ramsey number of powers of paths ⋮ Sparse partition universal graphs for graphs of bounded degree ⋮ 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 randomized embedding algorithm for trees ⋮ A note on the Size-Ramsey number of long subdivisions of graphs ⋮ The tripartite Ramsey number for trees ⋮ On the Size-Ramsey Number of 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 ⋮ The Approximate Loebl--Komlós--Sós Conjecture I: The Sparse Decomposition
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory
- Expanding graphs contain all small trees
- Explicit construction of linear sized tolerant networks
- Ramanujan graphs
- Simple Constructions of Almost k-wise Independent Random Variables
- The size Ramsey number of trees with bounded degree
- Random Cayley graphs and expanders
- On size Ramsey number of paths, trees, and circuits. I
- On an anti‐Ramsey property of Ramanujan graphs
- Probability Inequalities for Sums of Bounded Random Variables
- On the large sieve
This page was built for publication: The size-Ramsey number of trees
