Gregory–Hershkowitz–Kirkland maximum-spread conjecture for graphs
Statement
Let be a simple undirected graph of order , with adjacency eigenvalues and spread . Let , where is the clique of order and is the independent set on vertices, and let denote the maximum spread over all graphs of order . Gregory–Hershkowitz–Kirkland conjecture. For any positive integer , the graph of order with maximum spread is ; that is, is attained only by . The paper states that this is one of two conjectures resolved there, proving the claim for all sufficiently large using graph limits and numerical analysis.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.