Rees-algebra formulation of the Caccetta-Häggkvist conjecture
Rees-algebra formulation of the Caccetta-Häggkvist conjecture
Let be a digraph on vertices, let be its associated bipartite graph, and let be the perfect matching associated with . If is the defining ideal of the Rees algebra , Rees-algebra formulation of the Caccetta-Häggkvist conjecture. then, for some , has a binomial generator of degree that is square-free and has relatively prime terms, one of which is a product of elements of . The paper obtains this reformulation from the Jacobian-dual formulation using its theorem on the defining ideal of the Rees algebra; it is therefore equivalent to the original directed-cycle conjecture.
Sources & referencesView supporting material
Primary source
Huy Tai Ha and Susan Morey, “Algebraic algorithms for even circuits in graphs”, arXiv:1907.03166 (2019).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.