[1]
Benson, C. T. (1966) Minimal regular graphs of girths eight and twelve.
Canad. J. Math.
18
1091–1094.
[2]
Blagojević, P. V. M., Bukh, B. and Karasev, R. (2013) Turán numbers for Ks,t
-free graphs: Topological obstructions and algebraic constructions. Israel J. Math.
197
199–214. arXiv:1108.5254.
[3]
Bondy, J. A. and Simonovits, M. (1974) Cycles of even length in graphs.
J. Combin. Theory Ser. B
16
97–105.
[4]
Brown, W. G. (1966) On graphs that do not contain a Thomsen graph.
Canad. Math. Bull.
9
281–285.
[5]
Erdős, P. (1938) On sequences of integers no one of which divides the product of two others and on some related problems.
Inst. Math. Mech. Univ. Tomsk
2
74–82.
[6]
Erdős, P. (1964) Extremal problems in graph theory. In Theory of Graphs and its Applications (Proc. Sympos. Smolenice, 1963), Publ. House Czechoslovak Academy of Sciences, Prague, pp. 29–36.
[7]
Erdős, P. and Rényi, A. (1962) On a problem in the theory of graphs.
Magyar Tud. Akad. Mat. Kutató Int. Közl.
7
623–641.
[8]
Füredi, Z. and Simonovits, M. (2013) The history of degenerate (bipartite) extremal graph problems. Bolyai Soc. Math. Stud.
25
169–264. arXiv:1306.5167.
[9]
Füredi, Z., Naor, A. and Verstraëte, J. (2006) On the Turán number for the hexagon.
Adv. Math.
203
476–496.
[10]
Keevash, P. (2011) Hypergraph Turán problems. In Surveys in Combinatorics 2011, Vol. 392 of London Mathematical Society Lecture Note Series, Cambridge University Press, pp. 83–139.
[11]
Kővari, T., Sós, V. T. and Turán, P. (1954) On a problem of K. Zarankiewicz.
Colloquium Math.
3
50–57.
[12]
Lazebnik, F. and Ustimenko, V. A. (1995) Explicit construction of graphs with an arbitrary large girth and of large size.
Discrete Appl. Math.
60
275–284.
[13]
Mellinger, K. E. and Mubayi, D. (2005) Constructions of bipartite graphs from finite geometries.
J. Graph Theory
49
1–10.
[14]
Pikhurko, O. (2012) A note on the Turán function of even cycles.
Proc. Amer. Math. Soc.
140
3687–3692.
[15]
Sidorenko, A. (1995) What we know and what we do not know about Turán numbers.
Graphs Combin.
11
179–199.
[16]
Simonovits, M. (1968) A method for solving extremal problems in graph theory, stability problems. In Theory of Graphs: Proc. Colloq. Tihany 1966, Academic, pp. 279–319.
[17]
Turán, P. (1941) On an extremal problem in graph theory (in Hungarian).
Mat. Fiz. Lapok
48
436–452.
[18]
Verstraëte, J. (2000) On arithmetic progressions of cycle lengths in graphs. Combin. Probab. Comput.
9
369–373. arXiv:math/0204222.
[19]
Wenger, R. (1991) Extremal graphs with no C
4's, C
6's, or C
10's.
J. Combin. Theory Ser. B
52
113–116.
$80\sqrt{k\log k}\cdot n^{1+1/k}+O(n)$
edges.
$80 \sqrt{k\log k}$
but
$80\sqrt{k} \log k$
. The error was discovered by Xizhi Liu.
