Extremal construction conjecture for
For an integer , let be the asymptotic extremal constant studied in the paper, and let and denote the indicated graph constructions. Extremal construction conjecture for . One has
Moreover, the maximum is achieved by a blowup of
This gives the proposed exact value and extremal construction corresponding to the conjectured tightness of the lower bound for . 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
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.