← All problems

Brenti–Royle–Wagner w-polynomial conjectures

For a simple graph GG with nn vertices, define its ww-polynomial by ∑q≥0P(G;q)xq=w(G;x)(1−x)n+1\sum_{q\geq 0}P(G;q)x^q=\frac{w(G;x)}{(1-x)^{n+1}}, where P(G;q)P(G;q) is the chromatic polynomial. The conjectures are: (1) for every integer n≥5n\geq 5, every zero of w(Cn;x)w(C_n;x) is real; and (2) if GG and HH are simple graphs such that G∩HG\cap H is a complete graph, and every zero of both w(G;x)w(G;x) and w(H;x)w(H;x) is real, then every zero of w(G∪H;x)w(G\cup H;x) is real.

References

Source: arXiv

Progress summary

Refreshed
Open · solution reported

An unrefereed preprint claims to prove both conjectures, but no independent assessment was found.

The Brenti–Royle–Wagner conjectures concern real-rootedness of graph ww-polynomials, including cycles and unions formed by gluing along complete intersections.

Known results

  • C4C_4 is the smallest known ww-unreal graph, with w(C4,x)=2x2(7x2+4x+1)w(C_4,x)=2x^2(7x^2+4x+1).
  • Chordal graphs are ww-real.
  • Disjoint unions of ww-real graphs are ww-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 ww-polynomials have only real zeros for n≥5n\ge 5 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.

Sources

Solutions 0

No solutions have been posted yet.