✦ LIBER ✦

Some tree-star Ramsey Numbers

✍ Scribed by E.J Cockayne

Book ID: 107884031
Publisher: Elsevier Science
Year: 1974
Tongue: English
Weight: 221 KB
Volume: 17
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(74)90085-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Path-Star Ramsey numbers

✍ T.D Parsons 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 373 KB

Star-critical Ramsey numbers

✍ Jonelle Hook; Garth Isaak 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 252 KB

Tree-complete graph ramsey numbers

✍ V. Chvátal 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 50 KB

## Abstract The ramsey number of any tree of order __m__ and the complete graph of order __n__ is 1 + (__m__ − 1)(__n__ − 1).

Multipartite Graph-Tree Ramsey Numbers

✍ PAUL ERDÖS; R. J. FAUDREE; C. C. ROUSSEAU; R. H. SCHELP 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 449 KB

Star-path bipartite Ramsey numbers

✍ Johannes H. Hattingh; Michael A. Henning 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 213 KB

For bipartite graphs G1,G2 ..... Gk, the bipartite Ramsey number b(GI,G2,...,Gk) is the least positive integer b so that any colouring of the edges of Kb, b with k colours will result in a copy of Gi in the ith colour for some i. In this note, we establish the exact value of the bipartite Ramsey num

More star sub-ramsey numbers

✍ Geňa Hahn 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 841 KB