✦ LIBER ✦

Mixed ramsey numbers: Chromatic numbers versus graphs

✍ Scribed by James M. Benedict; Gary Chartrand; Don R. Lick

Publisher: John Wiley and Sons
Year: 1978
Tongue: English
Weight: 399 KB
Volume: 2
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190020203

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Size ramsey numbers of stars versus 4-ch

Size ramsey numbers of stars versus 4-chromatic graphs

✍ Oleg Pikhurko 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 124 KB 👁 1 views

## Abstract We investigate the asymptotics of the size Ramsey number __î__(__K__~1,__n__~__F__), where __K__~1,__n__~ is the __n__‐star and __F__ is a fixed graph. The author 11 has recently proved that __r̂__(__K__~1,n~,__F__)=(1+__o__(1))__n__^2^ for any __F__ with chromatic number χ(__F__)=3. He

Circular Chromatic Numbers and Fractiona

Circular Chromatic Numbers and Fractional Chromatic Numbers of Distance Graphs

✍ G.J. Chang; L. Huang; X. Zhu 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 171 KB

This paper studies circular chromatic numbers and fractional chromatic numbers of distance graphs G(Z , D) for various distance sets D. In particular, we determine these numbers for those D sets of size two, for some special D sets of size three, for

Irredundant ramsey numbers for graphs

✍ R. C. Brewster; E. J. Cockayne; C. M. Mynhardt 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 356 KB

Constrained Ramsey numbers of graphs

✍ Robert E. Jamison; Tao Jiang; Alan C. H. Ling 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 135 KB

## Abstract Given two graphs __G__ and __H__, let __f__(__G__,__H__) denote the minimum integer __n__ such that in every coloring of the edges of __K__~__n__~, there is either a copy of __G__ with all edges having the same color or a copy of __H__ with all edges having different colors. We show tha

Multichromatic numbers, star chromatic n

Multichromatic numbers, star chromatic numbers and Kneser graphs

✍ Johnson, A.; Holroyd, F. C.; Stahl, S. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 126 KB 👁 1 views

We investigate the relation between the multichromatic number (discussed by Stahl and by Hilton, Rado and Scott) and the star chromatic number (introduced by Vince) of a graph. Denoting these by χ \* and η \* , the work of the above authors shows that χ \* (G) = η \* (G) if G is bipartite, an odd cy

Path chromatic numbers of graphs

✍ Jin Akiyama; Hiroshi Era; Severino V. Gervacio; Mamoru Watanabe 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 112 KB