Ask a Question

Prefer a chat interface with context about you and your work?

Unmixed and Cohen–Macaulay Weighted Oriented Kőnig Graphs

Unmixed and Cohen–Macaulay Weighted Oriented Kőnig Graphs

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őnig, we characterize when I (D) is unmixed. If G has no 3- or 5-cycles, or G is …