Edge-deletion gamma-nonnegativity conjecture for symmetric edge polytopes

Let GG be a 2-connected graph with edge set EE, and let PGP_G denote its symmetric edge polytope. For an edge eEe\in E, let PGeP_{G\setminus e} be the symmetric edge polytope of the graph obtained by deleting ee. A palindromic polynomial is γ\gamma-nonnegative when its associated γ\gamma-polynomial has nonnegative coefficients. Edge-deletion gamma-nonnegativity conjecture. There exists an edge eEe\in E such that

hPG(t)hPGe(t)h^*_{P_G}(t)-h^*_{P_{G\setminus e}}(t)

is γ\gamma-nonnegative. This is described as an approach to the Ohsugi–Tsuchiya conjecture; the supplied text gives no resolution status.

Sources & referencesView supporting material

Primary source

Giulia Codenotti, Roberto Riccardi and Lorenzo Venturello, “The number of edges of a symmetric edge polytope”, arXiv:2512.16572 (2026).

Additional references

4 papers in this index state this conjecture (2022–2025). The statement above is taken from the most recent of them; the others are arXiv:2511.12499, arXiv:2508.20593, arXiv:2208.11181.

Progress summary

Never refreshed

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.