Balogh, J., Narayanan, B. and Skokan, J. (2019) The number of hypergraphs without linear cycles. J. Combin. Theory Ser. B 134 309–321.
Brown, W. G., Erdős, P. and Sós, V. (1973) On the existence of triangulated spheres in 3-graphs and related problems. Period. Math. Hungar. 3 221–228.
Bondy, A. and Simonovits, M. (1974) Cycles of even length in graphs. J. Combin. Theory Ser. B 16 97–105.
Bukh, B. and Jiang, Z. (2017) A bound on the number of edges in graphs without an even cycle. Combin. Probab. Comput. 26 1–15.
Collier-Cartaino, C., Graber, N. and Jiang, T. (2018) Linear Turán numbers of linear cycles and cycle-complete Ramsey numbers. Combin. Probab. Comput. 27 358–386.
Erdős, P. and Simonovits, M. (1966) A limit theorem in graph theory. Studia Sci. Math. Hungar. 1 51–57.
Erdős, P. and Simonovits, M. (1970) Some extremal problems in graph theory. In Combinatorial Theory and its Applications I (Proc. Colloq. Balatonfüred, 1969), North-Holland, pp. 377–390.
Erdős, P. and Simonovits, M. (1983) Supersaturated graphs and hypergraphs. Combinatorica 3 181–192.
Erdős, P. and Simonovits, M. (1984) Cube-supersaturated graphs and related problems. In Progress in Graph Theory (Waterloo, Ont., 1982), Academic Press, pp. 203–218.
Erdős, P. and Stone, H. (1946) On the structure of linear graphs. Bull. Amer. Math. Soc. 52 1087–1091.
Ergemlidze, B., Győri, E. and Methuku, A. (2019) Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs. J. Combin. Theory Ser. A 163 163–181.
Faudree, R. and Simonovits, M. (1983) On a class of degenerate extremal graph problems. Combinatorica 3 83–93.
Faudree, R. and Simonovits, M. Cycle-supersaturated graphs. In preparation.
Füredi, Z. and Jiang, T. (2014) Hypergraph Turán numbers of linear cycles. J. Combin. Theory Ser. A 123 252–270.
Füredi, Z. and Simonovits, M. (2013) The history of the degenerate (bipartite) extremal graph problems. In Erdős Centennial, Vol. 25 of Bolyai Society Mathematical Studies, Springer, pp. 169–264. See also arXiv:1306.5167.
Janson, S., Łuczak, T. and Ruciński, A. (2000) Random Graphs, Wiley.
Keevash, P. (2011) Hypergraph Turán problems. In Surveys in Combinatorics, Cambridge University Press, pp. 83–140.
Kostochka, A., Mubayi, D. and Verstraëte, J. (2015) Turán problems and shadows I: Paths and cycles. J. Combin. Theory Ser. A 129 57–79.
Morris, R. and Saxton, D. (2016) The number of C2l-free graphs. Adv. Math. 298 534–580.
Pikhurko, O. (2012) A note on the Turán function of even cycles. Proc. Amer. Math. Soc. 140 3687–3692.
Rödl, V. (1985) On a packing and covering problem. Europ. J. Combin. 6 69–78.
Ruzsa, I. and Szemerédi, E. Triples systems with no six points carrying three triangles. In Combinatorics II (Keszthely 1976), Vol. 18 of Colloquia Mathematica Societatis János Bolyai, pp. 939–945.
Sidorenko, A. (1991) Inequalities for functionals generated by bipartite graphs (in Russian). Diskret. Mat. 3 50–65. English translation: Discrete Math. Appl. 2 (1992) 489–504.
Sidorenko, A. (1993) A correlation inequality for bipartite graphs. Graphs Combin. 9 201–204.
Simonovits, M. (1982) Extremal graph problems, degenerate extremal problems, and supersaturated graphs. In Progress in Graph Theory (Waterloo 1982), Academic Press, pp. 419–437.
Verstraëte, J. (2000) On arithmetic progressions of cycle lengths in graphs. Combin. Probab. Comput. 9 369–373.
Wilson, R. (1972) An existence theory for pairwise balanced designs I: Composition theorems and morphisms. J. Combin. Theory Ser. A 13 220–245.
Wilson, R. (1972) An existence theory for pairwise balanced designs II: The structure of PBD-closed sets and the existence conjectures. J. Combin. Theory Ser. A 13 246–273.
Wilson, R. (1975) An existence theory for pairwise balanced designs III: Proof of the existence conjectures. J. Combin. Theory Ser. A 18 71–79.