Rees-algebra formulation of the Caccetta-Häggkvist conjecture

Let DD be a digraph on nn vertices, let G(D)G(D) be its associated bipartite graph, and let MDM_D be the perfect matching associated with DD. If JJ is the defining ideal of the Rees algebra R[I(G(D))t]R[I(G(D))t], Rees-algebra formulation of the Caccetta-Häggkvist conjecture. then, for some qq\leq\ell, JJ has a binomial generator of degree qq that is square-free and has relatively prime terms, one of which is a product of elements of MDM_D. 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

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.