Book Ramsey numbers. I

Random Structures and Algorithms

Volumn 27, Issue 3, 2005, Pages 379-400

  Nikiforov, Vladimir ^a   Rousseau, Cecil ^a  

^a University of Memphis   (United States)

Author keywords

Book; Ramsey number; Uniformity lemma

Indexed keywords

EID: 27844544647     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.20081     Document Type: Article

References (9)

1. N. Alon and J. Spencer, The probabilistic method, Wiley-Interscience Series in Discrete Mathematics and Optimization, Wiley, New York, 1992.
2. B. Bollobás, Modern graph theory, Graduate Texts in Mathematics 184, Springer-Verlag, New York, 1998.
3. B. Bollobás and V. Nikiforov, Books in graphs, European J Combin 26 (2004), 259-270.
4. R. Faudree, C. C. Rousseau, and J. Sheehan, Strongly regular graphs and finite Ramsey theory, Linear Algebra Appl 46 (1982), 221-241.
5. J. Komlós and M. Simonovits, "Szemerédi's regularity lemma and its applications in graph theory," Combinatorics, Paul Erdõs is eighty, Vol. 2 (Keszthely, 1993),
6. Bolyai Soc Math Stud 2, 295-352,
7. János Bolyai Math Soc, Budapest, 1996.
8. V. Nikiforov and C. C. Rousseau, A note on Ramsey numbers for books, J Graph Theory 49 (2005), 168-176.
9. C. C. Rousseau and J. Sheehan, On Ramsey numbers for books, J Graph Theory 2 (1978), 77-87.