The unmixed admissible clutter conjecture
Statement
Let be an admissible clutter, and let denote its edge ideal. The clutter is unmixed when all its minimal vertex covers have the same cardinality, and is Cohen–Macaulay when its quotient ring has this property in the standard graded sense. Unmixed admissible clutter conjecture. If is unmixed, then is Cohen–Macaulay. This is suggested by the corresponding Cohen–Macaulay and unmixed criteria for bipartite graphs; the general implication for admissible clutters remains open.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.