Maximal-clique partitions and the Roller Coaster Conjecture

Jonathan Cutler, Luke Pebody

A graph $G$ is {\em well-covered} if every maximal independent set has the same cardinality $q$. Let $i_k(G)$ denote the number of independent sets of cardinality $k$ in $G$. Brown…