Graffiti Conjecture 806
Statement
Let be the set of square-free integers in and the graph on in which two integers are adjacent when they are not coprime. From the cases and about twenty further values , Graffiti conjectured that the largest adjacency eigenvalue is at most the number of distinct vertex degrees.
False. At the graph has vertices, distinct degrees and ; the conjecture fails again for every from to , and the deficit grows roughly linearly in , so no additive correction survives either.
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.