An upper bound for ramsey numbers

Applied Mathematics Letters

Volumn 17, Issue 6, 2004, Pages 663-665

  Li, Yusheng ^a,b   Rousseau, C C ^c   Zang, Wenan ^d  

^a TONGJI UNIVERSITY   (China)

^b HOHAI UNIVERSITY   (China)

^c University of Memphis   (United States)

^d UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

General graphs; Ramsey number; Upper bound

Indexed keywords

MATHEMATICAL TECHNIQUES;

GENERAL GRAPH; RAMSEY NUMBERS; UPPER BOUND;

GRAPH THEORY;

EID: 33846096479     PISSN: 08939659     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0893-9659(04)90101-2     Document Type: Article

References (4)

1. K. Walker, Dichromatic graphs and Ramsey numbers, Y. Combin. Theory Set. B 5, 238-243, (1968).
2. Y. Huang and K. Zhang, New upper bound for Ramsey numbers, Europ. J. Combin. 19, 391-394, (1998).
3. A. Goodman, On sets of acquaintances and triangles at any part, Amsr. Math. Monthly 66,778-783, (1959).
4. C. Rousseau and J. Sheehan, On Ramsey numbers for books, Y. Graph Theory 2, 77-87, (1978).