Book Ramsey numbers and quasi-randomness

Combinatorics Probability and Computing

Volumn 14, Issue 5-6, 2005, Pages 851-860

  Nikiforov, V ^a   Rousseau, C C ^a   Schelp, R H ^a  

^a University of Memphis   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; RANDOM PROCESSES; SET THEORY;

EDGE COLORING; QUASI-RANDOMNESS; RAMSEY NUMBER; VERTICES;

NUMBER THEORY;

EID: 26644442819     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548305006929     Document Type: Article

References (11)

1. Bollobás, B. (1998) Modern Graph Theory, Vol. 184 of Graduate Texts in Mathematics, Springer, New York.
2. Chung, F., Graham, R. and Wilson, R. M. (1989) Quasi-random graphs. Combinatorica 9 345-362.
3. Erdos, P., Faudree, R., Rousseau, C. C. and Schelp, R. H. (1978) The size Ramsey number. Period. Math. Hungar. 9 145-161.
4. Faudree, R., Rousseau, C. C. and Sheehan, J. (1982) Strongly regular graphs and finite Ramsey theory. Linear Algebra Appl. 46 221-241.
5. Lorden, G. (1962) Blue-empty chromatic graphs. Amer. Math. Monthly 69 114-120.
6. Nikiforov, V. and Rousseau, C. C. (2005) A note on Ramsey numbers for books. J. Graph Theory 49 168-176.
7. Nordhaus, E. and Stewart, B. (1963) Triangles in an ordinary graph. Canad. J. Math. 15 33-41.
8. Rousseau, C. C. and Sheehan, J. (1978) On Ramsey numbers for books. J. Graph Theory 2 77-87.
9. Thomason, A. (1982) On finite Ramsey numbers. European J. Combin. 3 263-273.
10. Thomason, A. (1987) Random graphs, strongly regular graphs and pseudorandom graphs. Surveys in Combinatorics 1987, Vol. 123 of London Math. Soc. Lecture Note Ser., Cambridge University Press, Cambridge, pp. 173-195.
11. Thomason, A. (1989) Dense expanders and pseudo-random bipartite graphs. Discrete Math. 75 381-386.