Unmixed and Cohen--Macaulay weighted oriented K\"onig graphs
Commutative Algebra
2019-10-01 v1 Combinatorics
Abstract
Let be a weighted oriented graph, whose underlying graph is , and let be its edge ideal. If has no -, -, or -cycles, or is K\"{o}nig, we characterize when is unmixed. If has no - or -cycles, or is K\"onig, we characterize when is Cohen--Macaulay. We prove that is unmixed if and only if is Cohen--Macaulay when has girth greater than or is K\"onig and has no -cycles.
Keywords
Cite
@article{arxiv.1909.13295,
title = {Unmixed and Cohen--Macaulay weighted oriented K\"onig graphs},
author = {Yuriko Pitones and Enrique Reyes and Rafael H. Villarreal},
journal= {arXiv preprint arXiv:1909.13295},
year = {2019}
}