arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1508.00634math.CO
收藏

不包括钩子及其补语

Excluding hooks and their complements

Krzysztof Choromanski, Dvir Falik, Anita Liebenau, Viresh Patel, Marcin Pilipczuk

摘要:

著名的Erdos-Hajnal猜想指出,对于每个$n$ -顶点无向图$H$,存在$\eps(H)>0$使得每个不包含$H$作为诱导子图的图$G$包含大小至少为$n^{\eps(H)}$的团或独立集。该猜想的一个较弱的版本指出,多项式大小的集团/独立集现象发生,如果一个排除$H$和它的补充$H^{\compl}$。我们证明了较弱的猜想成立,如果$H$是任何道路的悬垂边在其第三个顶点,从而我们给了一个新的无限族的图猜想成立。

英文摘要:

The celebrated Erdos-Hajnal conjecture states that for every $n$-vertex undirected graph $H$ there exists $\eps(H)>0$ such that every graph $G$ that does not contain $H$ as an induced subgraph contains a clique or an independent set of size at least $n^{\eps(H)}$. A weaker version of the conjecture states that the polynomial-size clique/independent set phenomenon occurs if one excludes both $H$ and its complement $H^{\compl}$. We show that the weaker conjecture holds if $H$ is any path with a pendant edge at its third vertex; thus we give a new infinite family of graphs for which the conjecture holds.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑