Codegree and regularity of stable set polytopes

DOI10.5802/ALCO.460MaRDI QIDQ6876576zbMATH OpenFDO

Authors Koji Matsushita, Akiyoshi Tsuchiya

Publication date 12 January 2026

Published in Algebraic Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.5802/ALCO.460

zbMATH Keywords

chromatic numberclique numbercodegreeh-perfect graphmatching polytopeperfect graphregularitystable set polytopetoric ring

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Projective and free modules and ideals in commutative rings (13C10) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20)

Cites work

• A class of h-perfect graphs
• Binomial ideals
• Characteristic-independence of Betti numbers of graph ideals
• Computing the Continuous Discretely
• Convex polytopes all of whose reverse lexicographic initial ideals are squarefree
• Ehrhart theory of spanning lattice polytopes
• scientific article; zbMATH DE number 3168327 (Why is no real title available?)
• scientific article; zbMATH DE number 482758 (Why is no real title available?)
• Maximum matching and a polyhedron with 0,1-vertices
• Monomial ideals, edge ideals of hypergraphs, and their graded Betti numbers
• On certain polytopes associated with graphs
• On the facial structure of set packing polyhedra
• Special simplices and Gorenstein toric rings.
• The strong perfect graph theorem

This page was built for publication: Codegree and regularity of stable set polytopes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6876576)