Ehrhart clutters: regularity and max-flow min-cut

zbMath1189.13021arXiv0902.1354MaRDI QIDQ976696

Rafael H. Villarreal, José Martínez-Bernal, Edwin O'Shea

Publication date: 16 June 2010

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0902.1354

zbMATH Keywords

graphscluttersEhrhart cluttersEhrhart rings

Mathematics Subject Classification ID

Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Minimax problems in mathematical programming (90C47) Hypergraphs (05C65) Special types (Cohen-Macaulay, Gorenstein, Buchsbaum, etc.) (13H10) Commutative rings defined by monomial ideals; Stanley-Reisner face rings; simplicial complexes (13F55) Syzygies, resolutions, complexes and commutative rings (13D02) Perfect graphs (05C17)

Related Items (2)

Algebraic methods for parameterized codes and invariants of vanishing ideals over finite fields ⋮ Implosive graphs: Square-free monomials on symbolic Rees algebras

Uses Software

• polymake

This page was built for publication: Ehrhart clutters: regularity and max-flow min-cut