Indexed metadata
Diagonal F-threshold of binomial edge ideals
Giancarlo Rinaldo, Francesco Romeo
Source abstract
We compute the diagonal -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.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.