The Excluded Tree Minor Theorem Revisited

03/27/2023

∙

We prove that for every tree T of radius h, there is an integer c such that every T-minor-free graph is contained in H⊠ K_c for some graph H with pathwidth at most 2h-1. This is a qualitative strengthening of the Excluded Tree Minor Theorem of Robertson and Seymour (GM I). We show that radius is the right parameter to consider in this setting, and 2h-1 is the best possible bound.

READ FULL TEXT

The Excluded Tree Minor Theorem Revisited

The grid-minor theorem revisited

Packing and covering balls in graphs excluding a minor

On Chebotarëv's nonvanishing minors theorem and the Biró-Meshulam-Tao discrete uncertainty principle

Halfway to Hadwiger's Conjecture

An even better Density Increment Theorem and its application to Hadwiger's Conjecture

Notes on Tree- and Path-chromatic Number

Improved bounds for the zeros of the chromatic polynomial via Whitney's Broken Circuit Theorem

The Excluded Tree Minor Theorem Revisited

Related Research

The grid-minor theorem revisited

Packing and covering balls in graphs excluding a minor

On Chebotarëv's nonvanishing minors theorem and the Biró-Meshulam-Tao discrete uncertainty principle

Halfway to Hadwiger's Conjecture

An even better Density Increment Theorem and its application to Hadwiger's Conjecture

Notes on Tree- and Path-chromatic Number

Improved bounds for the zeros of the chromatic polynomial via Whitney's Broken Circuit Theorem