惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

Last Week in AI
Last Week in AI
U
Unit 42
博客园 - 【当耐特】
Y
Y Combinator Blog
H
Hackread – Cybersecurity News, Data Breaches, AI and More
Microsoft Security Blog
Microsoft Security Blog
Recent Announcements
Recent Announcements
P
Proofpoint News Feed
Martin Fowler
Martin Fowler
量子位
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
有赞技术团队
有赞技术团队
aimingoo的专栏
aimingoo的专栏
博客园 - 司徒正美
美团技术团队
雷峰网
雷峰网
小众软件
小众软件
G
Google Developers Blog
GbyAI
GbyAI
Jina AI
Jina AI
爱范儿
爱范儿
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
F
Fortinet All Blogs
Vercel News
Vercel News

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
Excluding surfaces as minors in graphs
Dimitrios M. Thilikos, Sebastian Wiederrecht · 2026-01-27 · via math.CO updates on arXiv.org

The Graph Minors Structure Theorem (GMST) of Robertson and Seymour states that for every graph $H,$ any $H$-minor-free graph $G$ has a tree-decomposition of bounded adhesion such that the torso of every bag embeds in a surface $Σ$ where $H$ does not embed after removing a small number of \textsl{apex vertices} and confining some vertices into a bounded number of \textsl{bounded depth} vortices. However, the functions involved in the original form of this statement were not explicit. In an enormous effort Kawarabayashi, Thomas, and Wollan proved a similar statement with explicit (and single-exponential in $|V(H)|$) bounds. However, their proof replaces the statement "a surface where $H$ does not embed'' with "a surface of Euler-genus in $\mathcal{O}(|H|^2)$''. In this paper we close this gap and prove that the bounds of Kawarabayashi, Thomas, and Wollan can be achieved with a tight bound on the Euler-genus. Moreover, we provide a more refined version of the GMST focussed exclusively on excluding, instead of a single graph, grid-like graphs that are minor-universal for a given set of surfaces. This allows us to give a description, in the style of Robertson and Seymour, of graphs excluding a graph of fixed Euler-genus as a minor, rather than focussing on the size of the graph.