Alon N. and Shikhelman C. (2016) Many T copies in H-free graphs. J. Combin. Theory Ser. B
Balogh J., Bollobás B. and Weinreich D. (2000) The speed of hereditary properties of graphs. J. Combin. Theory Ser. B
Bermond J., Bond J., Paoli M. and Peyrat C. (1983) Graphs and interconnection networks: Diameter and vulnerability. In Surveys in Combinatorics: Proceedings of the Ninth British Combinatorics Conference, Vol. 82 of London Mathematical Society Lecture Note Series, Cambridge University Press, pp. 1–30.
Boehnlein E. and Jiang T. (2012) Set families with a forbidden induced subposet. Combin. Probab. Comput.
Bollobás B. and Győri E. (2008) Pentagons vs. triangles. Discrete Math. 308
Bollobás B. and Thomason A. (1997) Hereditary and monotone properties of graphs. In The Mathematics of Paul Erdős II (Graham R. L.
et al., eds), pp. 70–78.
Chudnovsky M. (2014) The Erdős–Hajnal conjecture: A survey. J. Graph Theory
Chung F. R. K., Gyárfás A., Tuza Z. and Trotter W. T. (1990) The maximum number of edges in 2K
2-free graphs of bounded degree. Discrete Math.
Chung M., Jiang T. and West D. Induced Turán problems: Largest P
-free graphs with bounded degree. Submitted.
Chung M. and West D. (1993) Large P
4-free graphs with bounded degree. J. Graph Theory
Chung M. and West D. (1996) Large 2P
3-free graphs with bounded degree. Discrete Math.
Conlon D. (2012) On the Ramsey multiplicity of complete graphs. Combinatorica
Erdős P. (1962) On the number of complete subgraphs contained in certain graphs. Publ. Math. Inst. Hung. Acad. Sci., VII, Ser. A
Erdős P. (1964) On extremal problems of graphs and generalized graphs. Israel J. Math.
Erdős P., Frankl P. and Rödl V. (1986) The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent. Graphs Combin.
Erdős P. and Hajnal A. (1989) Ramsey-type theorems. Discrete Appl. Math.
Erdős P. and Simonovits M. (1982) Compactness results in extremal graph theory. Combinatorica
Erdős P. and Stone A. H. (1946) On the structure of linear graphs. Bull. Amer. Math. Soc.
Erdős P. and Szekeres G. (1935) A combinatorial problem in geometry. Comput. Math.
Fisher D. and Ryan J. (1992) Bounds on the number of complete subgraphs. Discrete Math.
Fox J. and Sudakov B. (2011) Dependent random choice. Random Struct. Alg.
Füredi Z. (1996) New asymptotics for bipartite Turán numbers. J. Combin. Theory Ser. A
Füredi Z. and Simonovits M. (2013) The history of degenerate (bipartite) extremal graph problems. In Erdős Centennial (Lovász L.
et al., eds), Vol. 25 of Bolyai Society Mathematical Studies, Springer, pp. 169–264.
Gyárfás A., Hubenko A. and Solymosi J. (2002) Large cliques in C
4-free graphs. Combinatorica
Győri E. and Li H. (2012) The maximum number of triangles in C
2k + 1-free graphs. Combin. Probab. Comput. 21
Hatami H., Hladký J., Král' D., Norine S. and Razborov A. (2013) On the number of pentagons in triangle-free graphs. J. Combin. Theory Ser. A
Li Y., Rousseau C. and Zang W. (2001) Asymptotic upper bounds for Ramsey functions. Graphs Combin.
Lu L. and Milans K. (2015) Set families with forbidden subposets. J. Combin. Theory Ser. A
Parsons T. D. (1973) The Ramsey numbers r(P
). Discrete Math.
Prömel H. and Steger A. (1991) Excluding induced subgraphs I: Quadrilaterals. Random Struct. Alg.
Prömel H. and Steger A. (1993) Excluding induced subgraphs II: Extremal graphs. Discrete Appl. Math.
Prömel H. and Steger A. (1992) Excluding induced subgraphs III: A general asymptotic. Random Struct. Alg.
Razborov A. (2010) On 3-hypergraphs with forbidden 4-vertex configurations. SIAM J. Discrete Math.
Sidorenko A. (1995) What we know and what we do not know about Turán numbers. Graphs Combin.
Simonovits M. and Sós V. T. (2001) Ramsey–Turán theory. Discrete Math.
Sós V. T. (1969) On extremal problems in graph theory. In Proceedings of the Calgary International Conference on Combinatorial Structures and their Application, Gordon and Breach, NY, pp. 407–410.
Turán P. (1941) On an extremal problem in graph theory (in Hungarian). Mat. Fiz. Lapok