Bounds for Ramsey numbers of complete graphs dropping an edge

European Journal of Combinatorics

Volumn 29, Issue 1, 2008, Pages 88-94

  Li, Yusheng ^a   Shen, Jian ^a  

^a TONGJI UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 35549008863     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejc.2006.12.007     Document Type: Article

References (10)

1. Chvátal V., and Harary F. Generalized Ramsey theory for graphs, II. Small diagonal numbers. Proc. Amer. Math. Soc. 32 (1972) 389-394
2. 5 - e. J. Graph Theory 13 (1989) 7-15
3. G. Exoo, New lower bounds for table III, Indiana State University, 2000. Available at: http://ginger.indstate.edu/ge/RAMSEY
4. 2, n. Graph Theory, Combinatorics, Algorithms, and Applications. In: Alavi Y., et al. (Ed). Proceeding in Applied Mathematics vol. 5.4 (1991), SIAM, Philadelphia, PA (Chapter 19)
5. Huang Y.R., and Zhang K.M. New upper bounds for Ramsey numbers. European J. Combin. 19 (1998) 391-394
6. Li Y., Rousseau C., and Zang W. An upper bound for Ramsey numbers. Appl. Math. Lett. 17 (2004) 663-665
7. Mathon R. Lower bounds for Ramsey numbers and association schemes. J. Combin. Theory Ser. B 42 (1987) 122-127
8. McDiarmid C., and Steger A. Tidoer examples for lower bounds on diagonal Ramsey numbers. J. Combin. Theory Ser. A 74 (1996) 147-152
9. Shearer J. Lower bounds for small diagonal Ramsey numbers. J. Combin. Theory Ser. A 42 (1986) 213-216
10. L.S. Shi, K.M. Zhang, An upper bound formula for Ramsey numbers, 2001. Manuscript