Induced subgraphs and tree decompositions XVI. Complete bipartite induced minors

We prove that for every graph G with a sufficiently large complete bipartite induced minor, either G has an induced minor isomorphic to a large wall, or G contains a large constellation; that is, a complete bipartite induced minor model such that on one side of the bipartition, each branch set is a singleton, and on the other side, each branch set induces a path. We further refine this theorem by characterizing the unavoidable induced subgraphs of large constellations as two types of highly structured constellations. These results will be key ingredients in several forthcoming papers of this series.