You Can Have It All: Small sparse induced-universal graphs for minor-closed classes
math.CO, cs.DM
Submitted: 2026-11-10
Updated: 2026-11-10
Code: https://github.com/patmorin/mflabelling
Terminology
Sources
- List-coloring apex-minor-free graphs
- The price of homogeneity is polynomial
- Structure of $k$-Matching-Planar Graphs
- On Universal Graphs for Trees and Tree-Like Graphs
- Quickly excluding a non-planar graph
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