Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
Proposition 3.2 (p. 7). Let be a positive integer not divisible by and put . Some regular triangle-free graph on vertices has edges and
each term tending to as .
The paper then deduces (p. 7): "By taking disjoint copies of appropriate graphs as above (and by adding, if needed, a constant number of isolated edges) it is easy to deduce from Proposition 3.2 that there exists some absolute positive constant so that for every there exists a triangle-free graph with edges satisfying . This shows that the exponent in (4) cannot be improved and completes the proof of Theorem 1.2." The graphs are the explicit construction of the author's 1994 paper (its [1]): for every not divisible by a triangle-free -regular graph on vertices with and smallest eigenvalue at least (p. 7); Lemma 3.1 converts the eigenvalue bound into the cut bound.
Source. N. Alon, Bipartite subgraphs, Combinatorica 16 (1996), no. 3, 301--311, doi:10.1007/BF01261315; the author's final version read for this card, Proposition 3.2 and the deduction on its p. 7, read on the page image.
Read depth. Claims checked: the proposition, the paragraph before it (the 1994 construction's parameters) and the deduction after it were read clause by clause on the page image of p. 7; the two-line derivation from Lemma 3.1 and the disjoint-copies deduction to every were not checked.
Dependencies
Same paper: Lemma 3.1 (p. 6). External: the explicit Ramsey graphs of N. Alon, Explicit Ramsey graphs and orthonormal labelings, Electron. J. Combin. 1 (1994), R12 (the paper's [1]); not held and not checked.
Bears on
- Problem 581: the upper half of the site's display, , with the constant along the sequence with .