Dirac's theorem on chordal graphs and Alexander duality (Q1883607)

Dirac's theorem is one of the fascinating results in classical graph theory. It states that a finite graph \(G\) is chordal (that is each cycle of length \(\geq 4\) has a chord) if and only if \(G\) has a perfect elimination ordering on its vertices. The authors give an algebraic proof of an equivalent form of Dirac's theorem. Such a proof is not easier than the original proof, but it gives new insight into the possible relation trees of a perfect ideal of codimension \(2\). Moreover, this new approach allows one to formulate a ``higher'' Dirac theorem, which is used to prove that all powers of non-skeleton facet ideals of a quasi-tree have a linear resolution.