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

无K_4图的二部化

Making a K_4-free graph bipartite

Benny Sudakov

摘要:

证明了任意n阶无K_4图G都可以通过删除至多n^2/9条边而成为二部图。此外,唯一需要删除那么多边的极值图是部分大小为n/3的完全3部图。这证明了P. Erdos的一个古老猜想。

英文摘要:

We show that every K_4-free graph G with n vertices can be made bipartite by deleting at most n^2/9 edges. Moreover, the only extremal graph which requires deletion of that many edges is a complete 3-partite graph with parts of size n/3. This proves an old conjecture of P. Erdos.

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

↑