ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let KnK_n be the complete graph on nn vertices, and let HH be a subgraph of KnK_n with ∣E(H)∣≤n−3|E(H)|\leq n-3. Write Kn\HK_n\backslash H for the graph obtained by removing the edges of HH from KnK_n. Edge-deletion conjecture. Removing up to n−3n-3 edges from KnK_n does not change its number of distinct eigenvalues; explicitly, for every such HH,

q(Kn\H)=2.q(K_n\backslash H)=2.

This would extend the equality known for n≤7n\leq 7 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.