2000 character limit reached
On the Gorenstein property of the Ehrhart ring of the stable set polytope of an h-perfect graph
Published 7 May 2020 in math.CO and math.AC | (2005.03259v2)
Abstract: In this paper, we give a criterion of the Gorenstein property of the Ehrhart ring of the stable set polytope of an h-perfect graph: the Ehrhart ring of the stable set polytope of an h-perfect graph $G$ is Gorenstein if and only if (1) sizes of maximal cliques are constant (say $n$) and (2) (a) $n=1$, (b) $n=2$ and there is no odd cycle without chord and length at least 7 or (c) $n\geq 3$ and there is no odd cycle without chord and length at least 5.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.