Image de couverture de livre

Polynomial Bounds in the Apex Minor Theorem

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Hendrey, Kevin, Wood, David R.
Format:	Preprint
Publié:	2025
Sujets:	Combinatorics Discrete Mathematics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Optimal Tree-Decompositions with Bags of Bounded Treewidth
par: Hendrey, Kevin, et autres
Publié: (2025)

Treewidth 2 in the Planar Graph Product Structure Theorem
par: Distel, Marc, et autres
Publié: (2024)

The Excluded Tree Minor Theorem Revisited
par: Dujmović, Vida, et autres
Publié: (2023)

Grid Minors and Products
par: Dujmović, Vida, et autres
Publié: (2024)

Sparse String Graphs and Region Intersection Graphs over Minor-Closed Classes have Linear Expansion
par: Karol, Nikolai, et autres
Publié: (2026)

Twin-width of sparse random graphs
par: Hendrey, Kevin, et autres
Publié: (2023)

Nowhere-zero flow reconfiguration
par: Esperet, Louis, et autres
Publié: (2025)

The Dominating 4-Colour Theorem
par: Girão, António, et autres
Publié: (2026)

Tree decompositions with small width, spread, order and degree
par: Wood, David R.
Publié: (2025)

Expansion of gap-planar graphs
par: Wood, David R.
Publié: (2025)

Tree-partitions of graphs with given pathwidth
par: Wood, David R.
Publié: (2026)

Structure of $k$-Matching-Planar Graphs
par: Hendrey, Kevin, et autres
Publié: (2025)

On universal graphs for trees and treewidth $k$ graphs
par: Kaul, Neel, et autres
Publié: (2025)

Cycles of Well-Linked Sets II: an Elementary Bound for the Directed Grid Theorem
par: Hatzel, Meike, et autres
Publié: (2026)

Excluding a Line Minor via Design Matrices and Column Number Bounds for the Circuit Imbalance Measure
par: Dadush, Daniel, et autres
Publié: (2025)

Reduced bandwidth: a qualitative strengthening of twin-width in minor-closed classes (and beyond)
par: Bonnet, Édouard, et autres
Publié: (2022)

Product Structure and Tree-Decompositions
par: Liu, Chun-Hung, et autres
Publié: (2024)

From Trees to Polynomials and Back Again: New Capacity Bounds with Applications to TSP
par: Gurvits, Leonid, et autres
Publié: (2023)

3-Colouring Planar Graphs
par: Dujmović, Vida, et autres
Publié: (2025)

Tree-partitions and small-spread tree-decompositions
par: Distel, Marc, et autres
Publié: (2026)

Twin-width of random graphs
par: Ahn, Jungho, et autres
Publié: (2022)

Induced Minors and Region Intersection Graphs
par: Bonnet, Édouard, et autres
Publié: (2025)

Packing Topological Minors Half-Integrally
par: Liu, Chun-Hung
Publié: (2017)

Basis Number of Graphs Excluding Minors
par: Geniet, Colin, et autres
Publié: (2026)

String Graph Obstacles of High Girth and of Bounded Degree
par: Chudnovsky, Maria, et autres
Publié: (2025)

Bears with Hats and Independence Polynomials
par: Blažej, Václav, et autres
Publié: (2021)

Three-dimensional graph products with unbounded stack-number
par: Eppstein, David, et autres
Publié: (2022)

A Polynomial-Time Approximation Algorithm for Complete Interval Minors
par: Bourneuf, Romain, et autres
Publié: (2025)

A multidimensional Ramsey Theorem
par: Girão, António, et autres
Publié: (2022)

Vertex-Based Localization of Turán's Theorem
par: Adak, Rajat, et autres
Publié: (2025)

On the Extension Theorem for Packing Steiner Forests
par: Zeng, Jinghan A
Publié: (2026)

Menger's Theorem for Temporal Paths (Not Walks)
par: Ibiapina, Allen, et autres
Publié: (2022)

A multipartite analogue of Dilworth's Theorem
par: Fox, Jacob, et autres
Publié: (2024)

Hypergraphs with Polynomial Representation: Introducing $r$-splits
par: Pitois, François, et autres
Publié: (2022)

Planar graphs in blowups of fans
par: Distel, Marc, et autres
Publié: (2024)

Adjacency labelling for proper minor-closed graph classes
par: Dujmović, Vida, et autres
Publié: (2026)

Number of Subgraphs and Their Converses in Tournaments and New Digraph Polynomials
par: Ai, Jiangdong, et autres
Publié: (2024)

Lower Bounds for Maximum Weight Bisections of Graphs with Bounded Degrees
par: Gerke, Stefanie, et autres
Publié: (2024)

Polynomial-time recognition and maximum independent set in Burling graphs
par: Rzążewski, Paweł, et autres
Publié: (2024)

Unique-neighbor Expanders with Better Expansion for Polynomial-sized Sets
par: Chen, Yeyuan
Publié: (2024)