Cohen-Macaulay graphs arising from digraphs

Simple item page
dc.creatorFerro, Giuseppa Carrá
dc.creatorFerrarello, Daniela
dc.date2007-03-14
dc.date.accessioned2026-07-07T07:51:54Z
dc.date.available2026-07-07T07:51:54Z
dc.descriptionIn 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.
dc.description20 pages
dc.identifierhttps://arxiv.org/abs/math/0703417
dc.identifierhttp://arxiv.org/abs/math/0703417
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/125685
dc.subjectCommutative Algebra
dc.subjectCombinatorics
dc.titleCohen-Macaulay graphs arising from digraphs
dc.typetext

Files

Collections

arXiv