Constructive bounds for a Ramsey-type problem

Graphs and Combinatorics

Volumn 13, Issue 3, 1997, Pages 217-225

  Alon, Noga ^a   Krivelevich, Michael ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001257756     PISSN: 09110119     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF03352998     Document Type: Article

References (21)

1. Alon, N.: Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory. Combinatorica 6, 207-219 (1986)
2. Alon, N.: Tough Ramsey graphs without short cycles. J. Algebraic Combinatorics 4, 189-195 (1995)
3. Alon, N.: Explicit Ramsey graphs and orthonormal labelings. The Electronic J. Combinatorics 1, R12 (1994)
4. Alon, N., Boppana, R.B., Spencer, J.H.: An asymptotic isoperimetric inequality (in preparation)
5. Alon, N., Chung, F.R.K.: Explicit construction of linear sized tolerant networks. Discrete Math. 72, 15-19 (1988)
6. Alon, N., Spencer, J.H., The probabilistic method. New York: Wiley 1992
7. Bollobás, B., Random graphs. London: Academic Press 1985
8. Bollobás, B., Hind, H.R.: Graphs without large triangle-free subgraphs. Discrete Math. 87, 119-131 (1991)
9. Chung, F.R.K., Cleve, R., Dagum, P.: A note on constructive lower bounds for the Ramsey numbers R(3, t). J. Comb. Theory Ser. B 57, 150-155 (1993)
10. Erdos, P.: On the construction of certain graphs. J. Comb. Theory 1, 149-153 (1966)
11. Erdos, P., Gallai, T.: On the minimal number of vertices representing the edges of a graph. Publ. Math. Inst. Hungar. Acad. Sci 6, 181-203 (1961)
12. Erdos, P., Rogers, C.A.: The construction of certain graphs. Canad. J. Math. 14, 702-707 (1962)
13. Frankl, P., Wilson, R.M.: Intersection theorems with geometric consequences. Combinatorica 1, 357-368 (1981)
14. Graham, R.L., Rothschild, B.L., Spencer, J.H., Ramsey theory (Second Edition). New York: Wiley 1990
15. Hall, M., Combinatorial theory (Second Edition). New York: Wiley 1986
16. Kleitman, D.J.: On a combinatorial problem of Erdos. J. Comb. Theory 1, 209-214 (1966)
17. s-free graphs without large K′-free subgraphs. Comb., Prob. and Computing 3, 349-354 (1994)
18. Krivelevich, M.: Bounding Ramsey numbers through large deviation inequalities. Random Str. Alg. 7, 145-155 (1995)
19. McDiarmid, C.J.H.: On the method of bounded differences. In: J. Siemens: Surveys in combinatorics 1989, London Math. Society Lecture Notes Series 141, pp. 148-188. Cambridge Univ. Press, 1989
20. Milman, V.D., Schechtman, G., Asymptotic theory of finite dimensional normed spaces. Lecture Notes in Mathematics 1200. Berlin Heidelberg New York: Springer 1986
21. Talagrand, M.: Concentration of measure and isoperimetric inequalities in product spaces. Inst. Hautes Études Sci. Publ. Math. 81, 73-205 (1995)