Year: 2024
Type: article
Abstract: Let G be a finite simple graph on n non-isolated vertices, and let [Formula: see text] be its binomial edge ideal. We determine almost all pairs [Formula: see text], where G ranges over all finite simple graphs on n non-isolated vertices, for any n.
Authors: Antonino Ficarra, Emanuele Sgroi
Institution: University of Messina
Language: English
Subfield: Algebra and Number Theory
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4404184802
