加载中…
We prove that for every graph , there exists such that every -vertex graph with no vertex-minors isomorphic to has a pair of disjoint sets , of vertices such that and is complete or anticomplete to . We deduce this from recent work of Chudnovsky, Scott, Seymour, and Spirkl (2018). This proves the analog of the Erd\H{o}s-Hajnal conjecture for vertex-minors.

生成讲解博客的中文版本

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