Spider leaf-deletion conjecture for domination-polynomial modes
Let be a spider, meaning a tree with one vertex of degree greater than , whose legs all have length at most . Let be obtained from by deleting a leaf, and let and be their domination polynomials. A mode of a unimodal polynomial is an index at which its coefficient sequence attains a maximum. Spider leaf-deletion conjecture. Both and are unimodal and have modes and , respectively, such that
The paper notes that this conjecture, together with its path-recursion lemma, would imply unimodality for all spider graphs. The supplied text does not establish the conjecture.
References
- Amanda Burcroff and Grace O'Brien, “Unimodality and monotonic portions of certain domination polynomials”, arXiv:2110.00709 (2021).
Progress summary
No public proof or counterexample has appeared, so the conjecture remains open.
A 2021 paper formulates the conjecture for spiders whose legs have length at most three: deleting one leaf should preserve unimodality and move a mode by at most one. The paper explains that this, together with a path-recursion lemma, would imply unimodality for all spider graphs, but does not prove it.
Known results
- All spider graphs with at most 400 legs have unimodal domination polynomials, with arbitrary leg lengths.
- The same paper records the broader leaf-deletion question for trees as open: whether two unimodal domination polynomials can have no modes within distance one.
Current status (as of November 2026): The spider leaf-deletion conjecture remains open; the bounded result for spiders with at most 400 legs is settled, but no proof or counterexample for the stated conjecture is recorded.
Sources
Solutions 0
No solutions have been posted yet.