A polynomial bound for the minimal excluded minors for a surface

Abstract: As part of the graph minor project, Robertson and Seymour showed in 1990 that the class of graphs that can be embedded in a given surface can be characterized by a finite set of minimal excluded minors. However, their proof, because existential, provides no explicit information about these excluded minors. In 1993, Seymour established the first upper bound on the order of such minimal excluded minors. Very recently, Houdaigoui and Kawarabayashi improved this result by deriving a quasi-polynomial upper bound. Despite this progress, the gap between this bound and the known linear lower bound $Ω(g)$ (where $g$ denotes the genus) remains substantial. In particular, they conjectured that a polynomial upper bound should hold. In this paper, we confirm this conjecture by showing that the order of the minimal excluded minors for a surface of genus $g$ is $O(g^{8+\varepsilon})$ for every $\varepsilon >0$. This result significantly narrows the gap between the known lower and upper bounds, bringing the asymptotic behavior much closer to the conjectured optimum. Our approach introduces a new forbidden structure of minimal excluded minors. Let $G$ be a minimal excluded minor for a surface of Euler genus $g$. Houdaigoui and Kawarabayashi showed that $G$ contains $O(\log g)$ pairwise disjoint cycles that are contractible and nested in some embedding of $G$. We strengthen this result by proving a separator-based variant: for any contractible subgraph $H \subseteq G$ with a separator of size $s$ (with $H$ completely contained in one side), the subgraph $H$ contains $O(\log s)$ disjoint cycles that are contractible and nested in some embedding of $G$. This allows us to replace a genus-dependent bound with a separator-dependent one, which is the main new ingredient in deriving our polynomial bound.

• The paper presents a novel separator-based approach proving a polynomial upper bound on the order of excluded minors for surfaces.
• It refines previous doubly-exponential bounds to an explicit O(g^(8+ε)) result, significantly improving algorithmic efficiency.
• The results offer practical insights for optimizing graph embeddability tests and minor decomposition techniques in bounded genus graphs.

Polynomial Bound for Minimal Excluded Minors on Surfaces: Summary and Implications

Context and Motivation

The paper "A polynomial bound for the minimal excluded minors for a surface" (2604.02796) addresses a longstanding structural question in graph minor theory: given a surface $S$ of Euler genus $g$, what is the largest possible order (number of vertices) of a graph that is a minimal excluded minor for $S$ (i.e., is not embeddable in $S$, but all its proper minors are embeddable)? The finiteness of the set of excluded minors was established by Robertson and Seymour for arbitrary surfaces via existential arguments; however, explicit enumerations or meaningful complexity bounds have remained elusive except for planar and projective planar cases.

Previous quantitative bounds were doubly-exponential in $g$ (Seymour, 1993), with more recent quasi-polynomial advances [HK2026]. The paper resolves the conjecture of [HK2026], confirming that a polynomial upper bound does indeed hold, with the explicit order $O(g^{8+\varepsilon})$ for every $\varepsilon > 0$.

Technical Approach and Structural Results

The crux of the proof is a refined forbidden structure analysis, replacing genus-dependent bounds on contractible cycles with separator-dependent arguments, leveraging treewidth and balanced separator theorems. The paper introduces several structural lemmas to handle contractible cycles and nested homotopies efficiently, thus sidestepping previous barriers.

Core Structural Ingredients

• Separator-Based Nested Cycles: For any contractible subgraph $H$ of an excluded minor $G$ with separator size $s$, $g$0 contains $g$1 nested, contractible, disjoint cycles in some embedding. This replaces earlier genus-dependent bounds with a much sharper separator-dependent variant.
• Balanced Tree Decomposition: Excluded minors are shown to admit tree decompositions whose properties facilitate finding small separators and hence reduce the complexity of contractible subgraph analysis.
• Iterative Separator Reduction: By recursive application, large contractible subgraphs can be reduced to those having separators of $g$2, and the number of contractible nested cycles drops to $g$3, which is critical for achieving polynomial bounds on their order.

Key Numerical Results

• The largest minimal excluded minor for a surface of Euler genus $g$4 has at most $g$5 vertices for every $g$6.
• Contradicts previous doubly-exponential and quasi-polynomial bounds, closing the gap to within polynomial factors of the linear lower bound.

Algorithmic Implications

Explicit polynomial bounds on the size of excluded minors have fundamental consequences for algorithmic graph theory, particularly regarding minor-closed properties and surface embeddability:

• Membership Testing for Minor-Closed Classes: Algorithms for testing whether a graph is embeddable in a surface or belongs to a minor-closed class can now be made efficient and constructive, as explicit enumeration of excluded minors is feasible when the order bound is polynomial.
• Surface Embedding Algorithms: The polynomial bound directly feeds into parametrized algorithms for embedding graphs into surfaces [KMR, GKR], improving practical embeddings and minor decompositions in quadratic or quasi-linear time.
• Minor Structure Theorems: Consistent with recent advances in graph minor structure theorems [polynomialGM], the polynomial bound enables tighter, more efficient algorithms for optimization and decomposition problems on bounded genus graphs.

Theoretical Significance and Future Directions

The reduction of upper bound complexity to polynomial in genus fundamentally changes the landscape for structural and algorithmic graph theory on surfaces. It brings the asymptotic behavior closer to planar analogs and grid minor bounds, enabling a more unified treatment of minor-closed properties across surfaces.

While the present exponent is $g$7, the results anticipate further technical refinements, possibly reducing the exponent to $g$8 or $g$9. Achieving sub-quadratic bounds may require novel forbidden structure paradigms. Open questions remain regarding precise tightness—whether almost linear or quadratic bounds are possible.

Conclusion

The paper confirms that minimal excluded minors for embedded surfaces are polynomially bounded in their order, with explicit structural and algorithmic ramifications. This advances the understanding of embeddability, minor-closed graph classes, and optimization on graphs of bounded genus. The separator-centric approach is likely to influence future work on the structure of forbidden minors, decomposition algorithms, and generalizations to other surface or minor-monotone parameters.