加载中…
A conjecture of Verstraëte states that for any fixed there exists a positive constant such that any -free graph contains a -free subgraph with at least edges. For , this conjecture was verified by Kühn and Osthus in 2004. We identify two counterexamples to this conjecture for and : the first comes from a recent construction of a dense -free subgraph of the hypercube and the second from Wenger’s construction for extremal -free graphs.

生成讲解博客的中文版本

生成AI智能校验的中文版本