Georgia Institute of Technology College of Sciences

Reed and Wood and independently Norine, Seymour, Thomas, and Wollan showed that for each $t$ there is $c(t)$ such that every graph on $n$ vertices with no $K_t$ minor has at most $c(t)n$ cliques. Wood asked in 2007 if $c(t)