Preprint
Diagonal F-threshold of binomial edge ideals
Mathematics
Abstract
We compute the diagonal $F$-threshold of binomial edge ideals associated to graphs in the case of cycles, cycles with whiskers, bipartite graphs, and block graphs. Moreover, we provide general bounds for any graph.