9 problems
Let be a directed graph, and let denote its ornamentation lattice. Polytopal realization conjecture. For any directed graph , the ornamentati…
Bóna–Ju–Ann conjecture. If , then
Ju's conjecture. The polynomial in the numerator of this Ehrhart series is symmetric, also known as palindromic.
Higashitani–Kummer–Michałek conjecture. (i) For any complete multipartite graph , the roots of lie on . (ii) If…
Let be a connected graph with vertices. Let be its symmetric edge polytope, and let denote the number of its facets. A -sum of…
Ohsugi–Tsuchiya conjecture. For every ,
Polytope characterization conjecture. There is a polytope whose vertices are labelled by the edges of and whose faces are in bijection with the induced subgraphs of hav…
Let be a symmetric edge polytope of type A, and let denote its -polynomial. Type A symmetric edge-polytope conjecture. The -polyn…
Let be a complete -partite graph of type , and let denote its Ehrhart polynomial. Complete multipartite Ehrhart conjecture. The polynomi…