arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1312.1680math.CO
收藏

同阶同大小的不相交诱导子图

Disjoint induced subgraphs of the same order and size

Béla Bollobás, Teeradej Kittipassorn, Bhargav Narayanan, Alex Scott

摘要:

对于图$G$,设$f(G)$是最大整数$k$,使得存在两个$G$的顶点不相交的诱导子图,每个子图在$k$的顶点上诱导相同的边数.我们证明了对于每个图$G$,在$n$的顶点上都有$f(G) \ge n/2 - o(n)$.这回答了卡罗和尤斯特的一个问题。

英文摘要:

For a graph $G$, let $f(G)$ be the largest integer $k$ for which there exist two vertex-disjoint induced subgraphs of $G$ each on $k$ vertices, both inducing the same number of edges. We prove that $f(G) \ge n/2 - o(n)$ for every graph $G$ on $n$ vertices. This answers a question of Caro and Yuster.

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

↑