𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The size-Ramsey number of trees

✍ Scribed by P. E. Haxell; Y. Kohayakawa

Book ID
112897909
Publisher
The Hebrew University Magnes Press
Year
1995
Tongue
English
Weight
638 KB
Volume
89
Category
Article
ISSN
0021-2172

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On size Ramsey number of paths, trees, a
On size Ramsey number of paths, trees, and circuits. I
✍ JóZsef Beck 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 622 KB

## Abstract The __size Ramsey number ř__(__G__) of a graph __G__ is the smallest integer ř such that there is a graph __F__ of ř edges with the property that __any__ two‐coloring of the edges of __F__ yields a monochromatic copy of __G__. First we show that the size Ramsey number ř(__P~n~__) of the

The size Ramsey number
The size Ramsey number
✍ P. Erdős; R. J. Faudree; C. C. Rousseau; R. H. Schelp 📂 Article 📅 1978 🏛 Springer Netherlands 🌐 English ⚖ 899 KB
The tripartite Ramsey number for trees
The tripartite Ramsey number for trees
✍ Julia Böttcher; Jan Hladký; Diana Piguet 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 338 KB

## Abstract We prove that for all ε>0 there are α>0 and __n__~0~∈ℕ such that for all __n__⩾__n__~0~ the following holds. For any two‐coloring of the edges of __K__~__n, n, n__~ one color contains copies of all trees __T__ of order __t__⩽(3 − ε)__n__/2 and with maximum degree Δ(__T__)⩽__n__^α^. This

Size bipartite Ramsey numbers
Size bipartite Ramsey numbers
✍ Yuqin Sun; Yusheng Li 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 356 KB