AI 中文总结
该研究给出图拟阵的面理想的渐近复苏的上下界，二者对哈密顿图重合，且对顶点数≤9的简单2-连通非哈密顿图，其渐近复苏取值为上述上界或下界。
AI 中文摘要
我们的主要结果是：以顶点数为参数给出图拟阵的面理想的渐近复苏的上界，以周长为参数给出其下界。对于哈密顿图，这些界重合；当n趋于无穷时，哈密顿图占n个顶点的图的大多数。对于顶点数不超过9的简单2-连通图，我们通过Sage计算得到，非哈密顿图拟阵的面理想的渐近复苏取值为上述上界或下界。
英文摘要
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.
Comments16 pages, comments welcome
