Every d-regular graph has an edge signing whose signed adjacency matrix has spectral radius at most 2 times the square root of d-1.
Statement
Every d-regular graph has an edge signing whose signed adjacency matrix has spectral radius at most 2 times the square root of d-1.
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.