2000 character limit reached
Unmixed and Cohen--Macaulay weighted oriented König graphs
Published 29 Sep 2019 in math.AC and math.CO | (1909.13295v1)
Abstract: Let $D$ be a weighted oriented graph, whose underlying graph is $G$, and let $I(D)$ be its edge ideal. If $G$ has no $3$-, $5$-, or $7$-cycles, or $G$ is K\"{o}nig, we characterize when $I(D)$ is unmixed. If $G$ has no $3$- or $5$-cycles, or $G$ is K\"onig, we characterize when $I(D)$ is Cohen--Macaulay. We prove that $I(D)$ is unmixed if and only if $I(D)$ is Cohen--Macaulay when $G$ has girth greater than $7$ or $G$ is K\"onig and has no $4$-cycles.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.