The Graham–Lovász conjecture on unimodality of normalized tree coefficients
Statement
Let be a tree of order . For a graph of order , write for the coefficients of its distance characteristic polynomial and define the normalized coefficients
for . A sequence is unimodal if it is nondecreasing up to some index and nonincreasing thereafter. Graham–Lovász's conjecture. The sequence is unimodal and its peak occurs at .
The conjecture concerns the shape of the coefficients of the distance characteristic polynomial of a tree. Its prescribed peak location was disproved by Collins in 1985, although unimodality is known for stars and paths; hence the conjecture as stated is refuted.
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.