Minimality conjecture for initial threshold graphs generated by RFI
Statement
Let and be fixed, and let . Let be the initial threshold graph obtained from RFI. Minimality conjecture. The graph is minimal: if is also -eigenvalue free, then . This conjecture asserts that no smaller threshold graph is -eigenvalue free. The authors report exhaustive computational searches for several positive values of that found no smaller example, but the general claim remains open.
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.