加载中…
We prove that for every complete graph , all graphs with no induced subgraph isomorphic to a subdivision of have a stable subset of size at least . This is close to best possible, because for , not all such graphs have a stable set of linear size, even if is triangle-free.

生成讲解博客的中文版本

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