Gorenstein polytopes obtained from bipartite graphs

Simple item page
dc.creatorTagami, Makoto
dc.date2008-03-07
dc.date2008-03-11
dc.date.accessioned2026-07-07T09:25:47Z
dc.date.available2026-07-07T09:25:47Z
dc.descriptionBeck et. al. characterized the grid graphs whose perfect matching polytopes are Gorenstein and they also showed that for some parameters, perfect matching polytopes of torus graphs are Gorenstein. In this paper, we complement their result, that is, we characterize the torus graphs whose perfect matching polytopes are Gorenstein. Beck et. al. also gave a method to construct an infinite family of Gorenstein polytopes. In this paper, we introduce a new class of polytopes obtained from graphs and we extend their method to construct many more Gorenstein polytopes.
dc.description11 pages, 5 figures
dc.identifierhttps://arxiv.org/abs/0803.1033
dc.identifierhttp://arxiv.org/abs/0803.1033
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/156526
dc.subjectCombinatorics
dc.subject05C70, 11H06 (Primary); 52C07 (Secondary)
dc.titleGorenstein polytopes obtained from bipartite graphs
dc.typetext

Files

Collections

arXiv