A strict asymptotic bound conjecture for Ky Fan graph eigenvalue sums
A strict asymptotic bound conjecture for Ky Fan graph eigenvalue sums
For a graph of order , let be the eigenvalues of its adjacency matrix in nonincreasing order of absolute value, and let be the maximum of over graphs of order . Define
Strict asymptotic bound conjecture. There exist infinitely many integers such that
The upper bound is attained asymptotically when is a square under the matrix condition discussed in the source, while the conjecture concerns infinitely many nonsquare cases where a strict inequality should hold.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Vladimir Nikiforov, “Extrema of graph eigenvalues”, arXiv:1502.00359 (2015).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.