On separators in K h-minor-free graphs
math.CO
Submitted: 2026-10-29
Updated: 2026-11-11
Comments: 18pages
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Sources
- A Separator for Minor-Free Graphs Beyond the Flow Barrier
- Computational Optimal Transport
- Eigenvalue bounds, spectral partitioning, and metrical deformations via flows
- Reweighted Spectral Partitioning Works: A Simple Algorithm for Vertex Separators in Special Graph Classes
- Separator Theorem for Minor-Free Graphs in Linear Time
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality