Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claim. , the statement of Problem 572 for . Corollary 3.3 of the paper (p. 77) states that for every , , with for odd and for even ; the introduction (p. 74) says the bound holds along an infinite sequence of values of . A graph with no cycle of length has no , so the bound is a lower bound for . At the exponent is . Directly: by Proposition 2.1, for a prime power the graph is -regular and bipartite of order with girth at least , so it has no and has edges, where . Since is nondecreasing in and consecutive prime powers differ by a factor at most , the bound holds for every with a smaller constant, the step recorded on the problem page for Benson's graphs.
Covers. The instance (the cycle ) only. For every the exponent is below , and for the paper itself defers to the bound 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.