The Graham–Lovász conjecture on unimodality of normalized tree coefficients

Let TT be a tree of order n3n\geq 3. For a graph GG of order nn, write δk(G)\delta_k(G) for the coefficients of its distance characteristic polynomial and define the normalized coefficients

dk(G)=δk(G)/2nk2,d_k(G)=|\delta_k(G)|/2^{n-k-2},

for 0kn20\leq k\leq n-2. A sequence is unimodal if it is nondecreasing up to some index and nonincreasing thereafter. Graham–Lovász's conjecture. The sequence d0(T),,dn2(T)d_0(T),\dots,d_{n-2}(T) is unimodal and its peak occurs at n/2\left\lfloor n/2\right\rfloor.

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

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.