The symmetric exchange generation conjecture for unicyclic graph toric ideals

Let GG be a unicyclic graph on nn vertices, and let cZ>0n\mathfrak{c} \in \mathbb{Z}_{>0}^n. Write Ker(πGc)\operatorname{Ker}(\pi_G^{\mathfrak{c}}) for the associated toric ideal, and call its binomial generators symmetric exchange binomials when they arise from symmetric exchanges. Symmetric exchange generation conjecture. For every such c\mathfrak{c}, the toric ideal

Ker(πGc)\operatorname{Ker}(\pi_G^{\mathfrak{c}})

is generated by all symmetric exchange binomials of Ker(πGc)\operatorname{Ker}(\pi_G^{\mathfrak{c}}). This conjecture proposes a uniform generation result for toric ideals associated with unicyclic graphs; the supplied text does not state whether it has been proved or disproved.

Sources & referencesView supporting material

Primary source

Takayuki Hibi and Seyed Amin Seyed Fakhari, “Bounded powers of edge ideals: The strong exchange property”, arXiv:2506.03480 (2025).

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.