Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


Claim. ex(n;C6)≫n4/3\mathrm{ex}(n;C_6)\gg n^{4/3}, the statement of Problem 572 for k=3k=3. Corollary 3.3 of the paper (p. 77) states that for every s≥2s\ge2, ex(v,{C3,C4,…,C2s+1})=Ω(v1+2/(3s−3+ϵ))\mathrm{ex}(v,\{C_3,C_4,\dots,C_{2s+1}\})=\Omega(v^{1+2/(3s-3+\epsilon)}), with ϵ=0\epsilon=0 for odd ss and ϵ=1\epsilon=1 for even ss; the introduction (p. 74) says the bound holds along an infinite sequence of values of vv. A graph with no cycle of length 3,…,2s+13,\dots,2s+1 has no C2sC_{2s}, so the bound is a lower bound for ex(v;C2s)\mathrm{ex}(v;C_{2s}). At s=3s=3 the exponent is 1+2/6=4/31+2/6=4/3. Directly: by Proposition 2.1, for a prime power qq the graph D(3,q)D(3,q) is qq-regular and bipartite of order 2q32q^3 with girth at least 88, so it has no C6C_6 and has q4=2−4/3v4/3q^4=2^{-4/3}v^{4/3} edges, where v=2q3v=2q^3. Since ex(n;C6)\mathrm{ex}(n;C_6) is nondecreasing in nn and consecutive prime powers differ by a factor at most 22, the bound holds for every nn with a smaller constant, the step recorded on the problem page for Benson's graphs.

Covers. The instance k=3k=3 (the cycle C6C_6) only. For every k≥4k\ge4 the exponent 1+2/(3k−3+ν)1+2/(3k-3+\nu) is below 1+1/k1+1/k, and for s=5s=5 the paper itself defers to the bound Ω(v1+1/5)\Omega(v^{1+1/5}) of the regular generalized hexagon (p. 74). The same instance is also settled by Benson 1966.

Depends on. Nothing in this wiki: the construction and the corollary are the paper's, and the monotonicity step is elementary.

Acceptance. Refereed: F. Lazebnik, V. A. Ustimenko and A. J. Woldar, A new series of dense graphs of high girth, Bull. Amer. Math. Soc. (N.S.) 32 (1995), no. 1, 73--79, doi:10.1090/S0273-0979-1995-00569-0, a refereed journal, where it appeared as a research announcement (received 26 October 1993). First posting: arXiv:math/9501231, 1 January 1995 (the date this page is named by). No reviewed evidence is listed: the site credits the paper with the general lower bound but labels the problem OPEN, and commentary on an open problem is not an acceptance. The site cites the authors' 1999 paper only for history.

Read depth. Proposition 2.1, Theorem 3.2, Corollary 3.3 and the introduction's statement of the bound were read; the proofs of Lemma 3.1 and Proposition 2.1 were not, and nothing is independently reviewed in this corpus.