Turán numbers of bipartite graphs and related Ramsey-type questions

Combinatorics Probability and Computing

Volumn 12, Issue 5-6 SPEC. ISS., 2003, Pages 477-494

  Alon, Noga ^a,b   Krivelevich, Michael ^b   Sudakov, Benny ^a,c  

^a INSTITUTE FOR ADVANCED STUDY   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

^c PRINCETON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; FUNCTIONS; MATHEMATICAL MODELS; PROBABILITY; SET THEORY; THEOREM PROVING;

BIPARTITE GRAPHS; RAMSEY NUMBER; SUBGRAPHS;

GRAPH THEORY;

EID: 2942603498     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548303005741     Document Type: Article

References (23)

1. Alon, N., Krivelevich, M. and Sudakov, B. (1999) Coloring graphs with sparse neighborhoods. J. Combin. Theory Ser. B 77 73-82.
2. Alon, N., Rónyai, L. and Szabó, T. (1999) Norm-graphs: Variations and applications. J. Combin. Theory Ser. B 76 280-290.
3. Alon, N. and Shapira, A. (2003) Testing subgraphs in directed graphs. In Proc. 35th ACM STOC, ACM Press, pp. 700-709.
4. Bollobás, B. (1978) Extremal Graph Theory, Academic Press, London.
5. Bollobás, B. (2001) Random Graphs, 2nd edn, Cambridge University Press, Cambridge.
6. Bollobás, B. and Thomason, A. (1998) Proof of a conjecture of Mader, Erdos and Hajnal on topological complete subgraphs. Europ. J. Combin. 19 883-887.
7. Chung, F. and Graham, R. (1998) Erdos on Graphs: His Legacy of Unsolved Problems, A. K. Peters Ltd., Wellesley, MA.
8. Duke, R. A., Erdos, P. and Rödl, V. Intersection results for small families. Submitted.
9. Erdos, P. (1967) Some recent results on extremal problems in graph theory. In Theory of Graphs (Rome, 1966), Gordon and Breach, New York, pp. 117-123.
10. Erdos, P. (1979) Problems and results in graph theory and combinatorial analysis. In Graph Theory and Related Topics (Proc. Conf. Waterloo, 1977), Academic Press, New York, pp. 153-163.
11. Erdos, P. (1984) On some problems in graph theory, combinatorial analysis and combinatorial number theory. In Graph Theory and Combinatorics (Cambridge, 1983), Academic Press, London, pp. 1-17.
12. Erdos, P. (1984) Extremal problems in number theory, combinatorics and geometry. In Proc. International Congress of Mathematicians (Warsaw, 1983), Vol. 1, PWN, Warsaw, pp. 51-70.
13. Erdos, P. (1990) Some of my old and new combinatorial problems. In Paths, Flows, and VLSI-Layout, Vol. 9 of Algorithms and Combinatorics, Springer, Berlin, pp. 35-45.
14. Füredi, Z. (1991) On a Turán type problem of Erdos. Combinatorica 11 75-79.
15. Gowers, W. T. (1998) A new proof of Szemerédi's theorem for arithmetic progressions of length four. Geom. Funct. Analysis 8 529-551.
16. Graham, R., Rödl, V. and Ruciński, A. (2000) On graphs with linear Ramsey numbers. J. Graph Theory 35 176-192.
17. Kollár, J., Rónyai, L. and Szabó, T. (1996) Norm-graphs and bipartite Turán numbers. Combinatorica 16 399-406.
18. Komlós, J. and Szemerédi, E. (1996) Topological cliques in graphs, II. Combin. Probab. Comput. 5 79-90.
19. Kostochka, A. and Rödl, V. (2001) On graphs with small Ramsey numbers. J. Graph Theory 37 198-204.
20. Kostochka, A. and Sudakov, B. (2003) On Ramsey numbers of sparse graphs. Combin. Probab. Comput. 12, 627-641.
21. Kövari, T., Sós, V. T. and Turán, P. (1954) On a problem of K. Zarankiewicz. Colloquium Math. 3 50-57.
22. Krivelevich, M. (1995) Bounding Ramsey numbers through large deviation inequalities. Random Struct. Alg. 7 145-155.
23. Sudakov, B. (2003) A few remarks on Ramsey-Turán-type problems. J. Combin. Theory Ser. B 88 99-106.