The edge-deletion conjecture for two-eigenvalue realizations of complete graphs
Statement
Let be the complete graph on vertices, and let be a subgraph of with . Write for the graph obtained by removing the edges of from . Edge-deletion conjecture. Removing up to edges from does not change its number of distinct eigenvalues; explicitly, for every such ,
This would extend the equality known for and give the conjectured threshold for guaranteeing a two-eigenvalue matrix realization after deleting edges from a complete graph.
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.