Almost linear bound on the order of excluded minors

Determine whether the maximum number of vertices of a minimal excluded minor for a surface of Euler genus g admits an almost linear upper bound in g.

Background

After establishing a polynomial bound O(g{8+ε}), the authors ask whether a much tighter, nearly linear dependence on the genus could hold for the maximal order of excluded minors.

This question aims to identify whether the optimal growth is close to the linear lower bound Ω(g).

References

Open problem. Is there an almost linear bound on the order of G?

A polynomial bound for the minimal excluded minors for a surface  (2604.02796 - Houdaigoui et al., 3 Apr 2026) in Open problem, Section 6 (Conclusion)