Scott–Seymour conjecture on induced odd subdivisions

For a graph $H$, an odd subdivision is a subdivision in which every replacing path has an odd number of edges. Scott–Seymour's conjecture. For every graph $H$ and integer $t$, the class of all graphs with no subgraph isomorphic to $K_{t,t}$ and no induced odd subdivision of $H$ has bounded chromatic number.

This conjecture connects exclusion of complete bipartite subgraphs with induced-subdivision restrictions. The source presents it as an open conjecture combining several themes of the survey.