Regularity bound by the number of maximal cliques for binomial edge ideals
Let be a graph, let be the polynomial ring over a field , and let be its binomial edge ideal. Let denote the number of maximal cliques of , and let
The clique-count regularity conjecture. For every graph ,
The bound is known for closed, or proper interval, graphs.
References
Status
- Solved: M. Rouzbahani Malayeri, S. Saeedi Madani, and D. Kiani. A proof for a conjecture on the regularity of binomial edge ideals (arXiv preprint (math.AC, math.CO), 2020) https://arxiv.org/abs/2007.09959
Source: M. Rouzbahani Malayeri, S. Saeedi Madani and D. Kiani, “A proof for a conjecture on the regularity of binomial edge ideals”, arXiv:2007.09959 (2020).
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.