Wiki
Wiki

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 kk be a positive integer not divisible by 33 and put n=23kn=2^{3k}. Some regular triangle-free graph GnG_n on nn vertices has e=(18+o(1))n5/3e=(\tfrac18+o(1))n^{5/3} edges and

f(Gn)≤e2+(1+o(1))94n4/3=e2+(9⋅22/5+o(1))e4/5,f(G_n)\le\frac e2+(1+o(1))\frac94n^{4/3}=\frac e2+(9\cdot2^{2/5}+o(1))e^{4/5},

each o(1)o(1) term tending to 00 as n→∞n\to\infty.

The paper then deduces (p. 7): "By taking disjoint copies of appropriate graphs GnG_n 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 C′C' so that for every ee there exists a triangle-free graph GG with ee edges satisfying f(G)≤e/2+C′e4/5f(G)\le e/2+C'e^{4/5}. This shows that the exponent 4/54/5 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 kk not divisible by 33 a triangle-free dnd_n-regular graph on n=23kn=2^{3k} vertices with dn=2k−1(2k−1−1)d_n=2^{k-1}(2^{k-1}-1) and smallest eigenvalue at least −9⋅2k−3⋅2k/2−1/4-9\cdot2^k-3\cdot2^{k/2}-1/4 (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 ee 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, f(m)≤m/2+c2m4/5f(m)\le m/2+c_2m^{4/5}, with the constant 9⋅22/5+o(1)9\cdot2^{2/5}+o(1) along the sequence n=23kn=2^{3k} with 3∤k3\nmid k.