The Graham–Lovász conjecture on unimodality of normalized tree coefficients
The Graham–Lovász conjecture on unimodality of normalized tree coefficients
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.
Sources & referencesView supporting material
Primary source
Leslie Hogben and Carolyn Reinhart, “Spectra of variants of distance matrices of graphs and digraphs: a survey”, arXiv:2103.00647 (2021).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.