Ramsey numbers and the size of graphs

SIAM Journal on Discrete Mathematics

Volumn 21, Issue 4, 2007, Pages 980-986

  Sudakov, Benny ^a,b  

^a PRINCETON UNIVERSITY   (United States)

^b INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

Probabilistic methods; Ramsey numbers

Indexed keywords

COMPLETE GRAPHS; EDGE COLORINGS; LOWER BOUNDS; MAXIMUM VALUES; OF GRAPHS; POLYLOGARITHMIC FACTORS; POSITIVE CONSTANTS; POSITIVE INTEGERS; PROBABILISTIC METHODS; RAMSEY NUMBERS; TWO GRAPHS;

CONTROL THEORY; MACHINE TOOLS; TURBULENT FLOW;

GRAPH THEORY;

EID: 56649113032     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/060667360     Document Type: Article

References (16)

1. M. AJTAI. J. KOMLÓS. AND E. SZEMERÉ DI, A note on Ramsey numbers, J. Combin. Theory Ser. A, 29 (1980), pp. 354-360.
2. N. ALON AND J. SPENCER, The Probabilistic Method, 2nd ed., Wiley, New York, 2000.
3. N. ALON, M. KRIVELEVICH, AND B. SUDAKOV, Turan numbers of bipartite graphs and related Ramsey-type questions, Combin. Probab. Comput., 12 (2003), pp. 477-494.
4. B. BOLLOBÁS, Random Graphs, 2nd ed., Cambridge Stud. Adv. Math. 73, Cambridge University Press, Cambridge, UK, 2001.
5. F. CHUNG AND R. GRAHAM, Erdos on Graphs. His Legacy of Unsolved Problems, A K Peters, Ltd., Wellesley, MA, 1998.
6. P. ERDOS, Solved and unsolved problems in combinatorics and combinatorial number theory, Congr. Numer., 32 (1981), 49-62.
7. P. ERDOS, On some problems in graph theory, combinatorial analysis and combinatorial number theory, in Graph Theory and Combinatorics (Cambridge, 1983), Academic Press, London, 1984, pp. 1-17.
8. P. ERDOS, R. FAUDREE, C. ROUSSEAU, AND R. SCHELP, A Ramsey problem of Harary on graphs with prescribed size, Discrete Math., 67 (1987), pp. 227-233.
9. P. ERDOS AND P. TETALI, Representation of integers as the sum of k terms, Random Structures Algorithms, 1 (1990), pp. 245-261.
10. R. GRAHAM, B. ROTHSCHILD, AND J. SPENCER, Ramsey Theory, 2nd ed., Wiley, New York, 1990.
11. 2 / log t, Random Structures Algorithms, 7 (1995), pp. 173-207.
12. T. KÖVARI, V. T. SÓS, AND P. TURÁN, On a problem of K. Zarankiewicz, Colloquium Math., 3 (1954), pp. 50-57.
13. M. KRIVELEVICH, Bounding Ramsey numbers through large deviation inequalities, Random Structures Algorithms, 7 (1995), pp. 145-155.
14. Y. LI AND W. ZANG, Ramsey numbers involving large dense graphs and bipartite Turán numbers, J. Combin. Theory Ser. B, 87 (2003), pp. 280-288.
15. A. SIDORENKO, The Ramsey number of an n-edge graph versus triangle is at most 2n + 1, J. Combin. Theory Ser. B, 58 (1993), pp. 185-196.
16. J. SPENCER, Asymptotic lower bounds for Ramsey numbers, Discrete Math., 20 (1977), pp. 69-76.