𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Bipartite Graphs with Linear Ramsey Numbers

✍ Scribed by R. L. Graham; V. Rödl; A. Ruciński

Publisher
Springer-Verlag
Year
2001
Tongue
English
Weight
201 KB
Volume
21
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On graphs with linear Ramsey numbers
On graphs with linear Ramsey numbers
✍ R. L. Graham; V. Rödl; A. Ruciński 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 141 KB 👁 1 views
Subdivided graphs have linear ramsey num
Subdivided graphs have linear ramsey numbers
✍ Noga Alon 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 247 KB

## Abstract It is shown that the Ramsey number of any graph with __n__ vertices in which no two vertices of degree at least 3 are adjacent is at most 12__n__. In particular, the above estimate holds for the Ramsey number of any __n__‐vertex subdivision of an arbitrary graph, provided each edge of t

Linear Ramsey numbers of sparse graphs
Linear Ramsey numbers of sparse graphs
✍ Lingsheng Shi 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 102 KB

## Abstract The Ramsey number __R__(__G__~1~,__G__~2~) of two graphs __G__~1~ and __G__~2~ is the least integer __p__ so that either a graph __G__ of order __p__ contains a copy of __G__~1~ or its complement __G__^c^ contains a copy of __G__~2~. In 1973, Burr and Erdős offered a total of $25 for se

Extremal theory and bipartite graph-tree
Extremal theory and bipartite graph-tree Ramsey numbers
✍ P. Erd'́os; R.J. Faudree; C.C. Rousseau; R.H. Schelp 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 675 KB

For a positive integer n and graph E, fs(n) is the least integer m such that any graph of order n and minimal degree m has a copy of B. It will be show that if B is a bipartite graph with parts of order k and 1 (k G I), then there exists a positive constant c, such that for any tree T,, of order II