Nonnegativity conjecture for the summed edge-deletion gamma-polynomial
Nonnegativity conjecture for the summed edge-deletion gamma-polynomial
Let be a 2-connected graph. For each edge , set , and let denote the -polynomial associated with this palindromic difference. Define
Summed edge-deletion nonnegativity conjecture. The polynomial has nonnegative coefficients. This is proposed as a stronger statement whose gamma-nonnegativity would imply the existence of an edge with gamma-nonnegative deletion difference; 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
2 papers in this index state this conjecture (2018–2025). The statement above is taken from the most recent of them; the others are arXiv:1809.00575.
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
Sign in to submit a solution.
No solutions have been posted yet.