Unimodality conjecture for matching polytopes of wheel graphs
Unimodality conjecture for matching polytopes of wheel graphs
Let be the wheel graph on vertices, with , and let denote its matching polytope. The coefficients of the -polynomial of form its -vector.
Unimodality conjecture. The -vector of is unimodal for every .
This conjecture is motivated by the unimodality of the computed -vectors for and by the question of whether IDP polytopes have unimodal -polynomials. The paper does not resolve it, and the broader question remains open.
Sources & referencesView supporting material
Primary source
Benjamin Eisley, Koji Matsushita and Andrés R. Vindas-Meléndez, “Matching polytopes, Gorensteinness, and the integer decomposition property”, arXiv:2407.08820 (2024).
Additional references
2 papers in this index state this conjecture (2013–2024). The statement above is taken from the most recent of them; the others are arXiv:1307.7422.
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.