← All problems

Extremal construction conjecture for α1,k\alpha_{1,k}

12 years old · documented by

For an integer k≥3k\geq 3, let α1,k\alpha_{1,k} be the asymptotic extremal constant studied in the paper, and let JrJ_r and KrK_r denote the indicated graph constructions. Extremal construction conjecture for α1,k\alpha_{1,k}. One has

α1,k=4k4k−1.\alpha_{1,k}=\frac{4k}{4k-1}.

Moreover, the maximum is achieved by a blowup of

G=kJ2∪(2k−1)K1‾=J2k−1∨kJ2‾.G=\overline{kJ_2\cup (2k-1)K_1}=J_{2k-1}\vee \overline{kJ_2}.

This gives the proposed exact value and extremal construction corresponding to the conjectured tightness of the lower bound for k≥3k\geq 3. The supplied context does not state whether the conjecture has been resolved.

References

2 papers in this index state this conjecture (2013–2026). The statement above is taken from the most recent of them; the others are arXiv:1303.1026.

Source: Sahil Agarwal, Carter Antley, Joseph Aulenbacher, George Brooks, Ian Gonzalez, Luke Hawranick, William Linz, Linyuan Lu and Aiden Williams, “Generalized Nordhaus–Gaddum Inequalities for Eigenvalues”, arXiv:2607.15941 (2026).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.