1 problem

For an integer $t\geq 2$, let $h(t)$ be the largest chromatic number of a hypergraph with no $K_t$-minor; the paper establishes that this quantity exists. A hypergraph is $K_t$-min…