A note on Ramsey numbers for books

Journal of Graph Theory

Volumn 49, Issue 2, 2005, Pages 168-176

  Nikiforov, Vladimir ^a   Rousseau, Cecil C ^a  

^a University of Memphis   (United States)

Author keywords

Books; Ramsey number; Strongly regular graphs

Indexed keywords

INTEGER PROGRAMMING; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; SET THEORY; THEOREM PROVING;

BOOKS; RAMSEY NUMBER; STRONGLY REGULAR GRAPHS; TRIANGLES;

GRAPH THEORY;

EID: 20544456172     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/jgt.20071     Document Type: Article

References (7)

1. B. Andrásfai, P. Erdos, and V. T. Sós, On the connection between chromatic number, maximal clique, and minimal degree of a graph, Discrete Math 8 (1974), 205-218.
2. B. Bollobás, Modern Graph Theory, Springer-Verlag, New York, 1998.
3. B. Bollobás, C. Nara, and S. Tachibana, The maximal number of induced complete bipartite graphs, Discrete Math 62 (1986), 271-275.
4. A. E. Brouwer, "Strongly regular graphs," Handbook of Combinatorial Designs, C. J. Colbourn and J. H. Dinitz, (Editors), CRC Press, Boca Raton, 1996, pp. 667-685.
5. R. J. Faudree, C. C. Rousseau, and J. Sheehan, Strongly regular graphs and finite Ramsey theory, Linear Algebra Appl 46 (1982), 221-241.
6. T. D. Parsons, "Ramsey graph theory," Selected Topics in Graph Theory, L. W. Beineke and R. J. Wilson, (Editors), Academic Press, London, 1978, pp. 361-384.
7. C. C. Rousseau and J. Sheehan, On Ramsey numbers for books, J Graph Theory 2 (1978), 77-87.