Asymptotic Resurgence of Facet ideals of Graphic Matroids

Our main results are an upper bound on the asymptotic resurgence of the facet ideal of a graphic matroid in terms of the number of vertices and a lower bound in terms of the circumference.

These bounds coincide for Hamiltonian graphs, which form the majority of graphs on $n$ vertices as $n$ tends to infinity.

For simple $2$-connected graphs on up to nine vertices, we compute in Sage that the asymptotic resurgence of the facet ideal of a non-Hamiltonian graphic matroid is given either by our upper or lower bound.