论文部分内容阅读
We prove that for all positive integers t,every n-vertex graph with no Kt-subdivision has at most 294tn cliques.We also prove that asymptotically,such graphs contain at most 2(5+o(1))tn cliques,where o(1)tends to zero as t tends to infinity.This strongly answers a question of D.Wood asking if the number of cliques in n-vertex graphs with no Kt-minor is at most 2ctn for some constant c.