A generalization of the Grid Theorem

Jim Geelen, Benson Joeris

A graph has tree-width at most $k$ if it can be obtained from a set of graphs each with at most $k+1$ vertices by a sequence of clique sums. We refine this definition by, for each…