Cohen-Macaulay graphs arising from digraphs
Abstract
In this paper we show a correspondence between directed graphs and bipartite undirected graphs with a perfect matching, that allows to study properties of directed graphs through the properties of the corresponding undirected graphs. In particular it is shown that a directed graph is transitive iff a corresponding undirected graph is Cohen-Macaulay.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.