The classification conjecture for Laplacian-realizable sets S_i,n_n^m
Statement
For integers , , and with , let denote the multiset obtained from by deleting and , and repeating once, with so that the corresponding graph is connected. A set is Laplacian realizable if it is the Laplacian spectrum of a connected simple graph on vertices. The classification conjecture. For , the only Laplacian-realizable sets of kind are , , , and . The conjecture is motivated by the complete search through order described in the paper and by the structural results on Cartesian products; no resolution beyond those cases is supplied.
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.