Brenti–Royle–Wagner w-polynomial conjectures
For a simple graph with vertices, define its -polynomial by , where is the chromatic polynomial. The conjectures are: (1) for every integer , every zero of is real; and (2) if and are simple graphs such that is a complete graph, and every zero of both and is real, then every zero of is real.
References
- Real zeros of w-polynomials: cycles and complete cutsets — arXiv — Hongyue Tang, Lily Li Liu
Source: arXiv
Progress summary
An unrefereed preprint claims to prove both conjectures, but no independent assessment was found.
The Brenti–Royle–Wagner conjectures concern real-rootedness of graph -polynomials, including cycles and unions formed by gluing along complete intersections.
Known results
- is the smallest known -unreal graph, with .
- Chordal graphs are -real.
- Disjoint unions of -real graphs are -real.
- The complete-intersection gluing assertion was recorded as a conjecture in a survey.
October 31, 2026 claimed proof
Hongyue Tang and Lily Li Liu’s preprint claims that cycle -polynomials have only real zeros for and that gluing along a complete intersection preserves real-rootedness. The retrieved record contains no independent verification, referee report, correction, or counterexample.
Current status (as of November 2026): Both conjectures are claimed proved in an unrefereed preprint, but the claims remain unverified in the retrieved evidence.
Solutions 0
No solutions have been posted yet.