A new lower bound for a ramsey-type problem

Combinatorica

Volumn 25, Issue 4, 2005, Pages 487-498

  Sudakov, Benny ^a  

^a PRINCETON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33645912360     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00493-005-0029-3     Document Type: Article

References (10)

1. N. ALON and M. KRIVELEVICH: Constructive bounds for a Ramsey-type problem, Graphs and Combinatorics 13 (1997), 217-225.
2. B. BOLLOBÁS and H. R. HIND: Graphs without large triangle free subgraphs, Discrete Math. 87(2) (1991), 119-131.
3. R. DUKE, H. LEFMANN and V. RÖDL: On uncrowded hypergraphs, Random Structures Algorithms 6 (1995), 209-212.
4. P. ERDOS and T. GALLAI: On the minimal number of vertices representing the edges of a graph, Publ. Math. Inst. Hungar. Acad. Sci. 6 (1961), 181-203.
5. P. ERDOS and C. A. ROGERS: The construction of certain graphs, Canadian J. Math. 14 (1962), 702-707.
6. nd ed., Wiley, New York, 1990.
7. r-free subgraphs, Combinatorics, Probability and Computing 3 (1994), 349-354.
8. M. KRIVELEVICH: Bounding Ramsey numbers through large deviation inequalities, Random Structures Algorithms 7 (1995), 145-155.
9. C. L. LIU: Introduction to combinatorial mathematics, McGraw-Hill Book Co., New York, 1968.
10. J. SHEARER: On the independence number of sparse graphs, Random Structures Algorithms 7 (1995), 269-271.