Unmixed and Cohen--Macaulay weighted oriented K\"onig graphs
Yuriko Pitones, Enrique Reyes, Rafael H. Villarreal

TL;DR
This paper characterizes when the edge ideal of a weighted oriented graph is unmixed or Cohen--Macaulay based on the absence of certain cycles and properties of the underlying graph, such as being K"onig.
Contribution
It provides new characterizations of unmixed and Cohen--Macaulay properties for edge ideals of weighted oriented graphs under specific cycle restrictions.
Findings
Unmixedness characterized for graphs with no 3, 5, or 7 cycles or K"onig graphs.
Cohen--Macaulayness characterized for graphs with no 3 or 5 cycles or K"onig graphs.
Unmixedness and Cohen--Macaulayness coincide for graphs with girth greater than 7 or K"onig graphs without 4-cycles.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
