Binomial edge ideals and conditional independence statements

We introduce binomial edge ideals attached to a simple graph G and study their algebraic properties. We characterize those graphs for which the quadratic generators form a Gröbner basis in a lexicographic order induced by a vertex labeling. Such graphs are chordal and claw-free. We give a reduced sq...

Ausführliche Beschreibung