Cohen-Macaulay graphs arising from digraphs

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
20 pages

Keywords

Commutative Algebra, Combinatorics

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/125685

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0703417
 http://arxiv.org/abs/math/0703417

Collections

arXiv