Michael–Traves conjecture: the Roller Coaster Conjecture
Let be a positive integer, let be a permutation of , and let denote the number of independent sets of cardinality in a graph . A graph is well-covered if all its maximal independent sets have the same size, and denotes its independence number. Roller Coaster Conjecture. There is a well-covered graph with such that
References
2 papers in this index state this conjecture (2004–2014). The statement above is taken from the most recent of them; the others are arXiv:math/0406623.
Status
- Solved: Jonathan Cutler and Luke Pebody. Maximal-clique partitions and the Roller Coaster Conjecture (arXiv, 2014) https://arxiv.org/html/1412.4595
Source: Jonathan Cutler and Luke Pebody, “Maximal-clique partitions and the Roller Coaster Conjecture”, arXiv:1412.4595 (2014).
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
No solutions have been posted yet.