Alavi–Erdős–Malde–Schwenk conjecture on unimodality for trees and forests

From papers

A tree is a connected acyclic graph, and a forest is an acyclic graph. For a graph GG, its independence sequence (i0(G),i1(G),,iα(G)(G))(i_0(G),i_1(G),\ldots,i_{\alpha(G)}(G)) records the numbers of independent sets of each cardinality. Alavi–Erdős–Malde–Schwenk conjecture. Every tree and every forest has a unimodal independence sequence. The paper states that this conjecture remains open, in contrast with the disproved unimodality conjecture for all well-covered graphs.

Progress summary

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

Sources & referencesView supporting material

Primary source

Jonathan Cutler and Luke Pebody, “Maximal-clique partitions and the Roller Coaster Conjecture”, arXiv:1412.4595 (2014).

Additional references

3 papers in this index state this conjecture (2011–2014). The statement above is taken from the most recent of them; the others are arXiv:1312.6524, arXiv:1110.3760.

Solutions 0

No solutions have been posted yet.