Toric ideals of matching polytopes for bipartite graphs have generators of degree at most 3, shown equivalent to an edge-coloring result, with a new characterization for the quadratic case.
McKay and Adolfo Piperno
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.AC 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Toric ideal of matching polytopes and edge colorings
Toric ideals of matching polytopes for bipartite graphs have generators of degree at most 3, shown equivalent to an edge-coloring result, with a new characterization for the quadratic case.