✦ LIBER ✦

On graphs with linear Ramsey numbers

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

Publisher: John Wiley and Sons
Year: 2000
Tongue: English
Weight: 141 KB
Volume: 35
Category: Article
ISSN: 0364-9024
DOI: 10.1002/1097-0118(200011)35:3<176::aid-jgt3>3.0.co;2-c

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fan-complete graph Ramsey numbers

✍ Li, Yusheng; Rousseau, Cecil C. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 427 KB 👁 2 views

It is shown that if G and H are arbitrary fixed graphs and n is sufficiently large, then Also, we prove that r ( K 1 +F, K,) 5 (m+o(l))&(n -+ GO) for any forest Fwhose largest component has m edges. Thus r(Fe, K,) 5 (1 + o(l))&, where Fe = K1 + CK2. We conjecture that r(Fe, K,) -&(n + cm).

CO-irredundant Ramsey numbers for graphs

✍ E. J. Cockayne; G. MacGillivray; J. Simmons 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 120 KB

Local and meank-Ramsey numbers for compl

Local and meank-Ramsey numbers for complete graphs

✍ Schelp, R. H. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 67 KB 👁 1 views

This paper establishes that the local k-Ramsey number R(K m , k -loc) is identical with the mean k-Ramsey number R(K m , k -mean). This answers part of a question raised by Caro and Tuza.

Independence numbers of locally sparse g

Independence numbers of locally sparse graphs and a Ramsey type problem

✍ Noga Alon 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 409 KB 👁 1 views

Let G = (V, E ) be a graph on n vertices with average degree t 2 1 in which for every vertex u E V the induced subgraph on the set of all neighbors of u is r-colorable. We show that the independence number of G is at least log t , for some absolute positive constant c. This strengthens a well-known

Graphs with large total domination numbe

Graphs with large total domination number

✍ Michael A. Henning 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 246 KB 👁 1 views

Domination critical graphs with higher i

Domination critical graphs with higher independent domination numbers

✍ Ao, S.; Cockayne, E.J.; MacGillivray, G.; Mynhardt, C.M. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 348 KB 👁 2 views

We show that for each k L 4 there exists a connected k-domination critical graph with independent domination number exceeding k, thus disproving a conjecture of Sumner and Blitch ( J Cornbinatorial Theory B 34 (19831, 65-76) in all cases except k = 3.