On graphs containing few disjoint excluded minors. Asymptotic number and structure of graphs containing few disjoint minors K4

TL;DR

This paper investigates the asymptotic enumeration and typical structure of graphs that contain at most a fixed number of disjoint minors K4, revealing a tree-like structure with high-degree vertices for such graphs.

Contribution

It provides new asymptotic counting formulas and structural descriptions for graphs with a bounded number of disjoint K4 minors, extending known results for series-parallel graphs.

Findings

Precise asymptotic formulas for graphs with at most k disjoint K4 minors.

Typical graphs have a tree-like structure with 2k+1 high-degree vertices.

Results apply to classes containing arbitrarily large fans of forbidden minors.

Abstract

Let ${\rm ex \,} {\mathcal B}$ be a minor-closed class of graphs with a set ${\mathcal B}$ of minimal excluded minors. We study (a) the asymptotic number of graphs without $k+1$ disjoint minors in ${\mathcal B}$ and (b) the properties of a uniformly random graph drawn from all such graphs on vertices $\{1,\dots,n\}$. We present new results in the case when ${\rm ex \,} {\mathcal B}$ contains arbitrarily large fans for a general (good enough) set of forbidden minors ${\mathcal B}$. A particular case where our results hold is ${\mathcal B} = \{K_4\}$. For any fixed $k = 1, 2, \dots$ we derive precise asymptotic counting formulas and describe the structure of typical graphs that have at most $k$ disjoint minors $K_4$. For $k = 0$ this is the well-known class of series-parallel graphs. For $k \ge 1$ we show that typical instances have an elaborate tree-like structure with $2k+1$ special vertices of very high degree. The proofs combine a variety of methods, including new structural results, Robertson and Seymour's graph minor theory and analytic combinatorics.