Ehrhart series of fractional stable set polytopes of finite graphs
From MaRDI portal
Publication:1787967
Abstract: The fractional stable set polytope of a simple graph with vertices is a rational polytope that is the set of nonnegative vectors satisfying for every edge of . In this paper we show that (i) The -vector of a lattice polytope is alternatingly increasing; (ii) The Ehrhart ring of is Gorenstein; (iii) The coefficients of the numerator of the Ehrhart series of are symmetric, unimodal and computed by the -vector of .
Recommendations
- On the Gorenstein property of the Ehrhart ring of the stable set polytope of an h-perfect graph
- \(h^\ast\)-vectors, Eulerian polynomials and stable polytopes of graphs
- Ehrhart series for connected simple graphs
- Interlacing Ehrhart polynomials of reflexive polytopes
- Facets of the \(r\)-stable \((n,k)\)-hypersimplex
Cites work
- scientific article; zbMATH DE number 3983158 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- A decomposition of 2-weak vertex-packing polytopes
- Gorenstein algebras of Veronese type
- Gröbner Bases
- Inequalities and Ehrhart $\delta $-vectors
- Properties of vertex packing and independence system polyhedra
- Special simplices and Gorenstein toric rings.
- Two poset polytopes
- Unimodality questions for integrally closed lattice polytopes
- \(h\)-vectors of Gorenstein polytopes
- \(h^\ast\)-vectors, Eulerian polynomials and stable polytopes of graphs
Cited in
(2)
This page was built for publication: Ehrhart series of fractional stable set polytopes of finite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1787967)