The symmetric exchange generation conjecture for unicyclic graph toric ideals
The symmetric exchange generation conjecture for unicyclic graph toric ideals
Let be a unicyclic graph on vertices, and let . Write 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 , the toric ideal
is generated by all symmetric exchange binomials of . 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
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.