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

图中的双胞胎

Twins in graphs

Maria Axenovich, Ryan R. Martin, Torsten Ueckerdt

摘要:

一个基本的鸽子洞原则确保存在两个相同类型的对象,如果对象的数量大于类型的数量。这样的原理能推广到更复杂的组合结构吗?在这里,我们解决这样一个问题的图形。我们称两个顶点的不相交子集$A, B$为\emph{\textbf{twins}},如果它们具有相同的基数,并诱导相同大小的子图。令$t(G)$是最大的$k$,使得$G$在每个$k$顶点上都有孪生。利用诱导子图的差异结果,给出了$t(G)$的边数和顶点数的界.此外,我们给出的条件下,$t(G)= |V(G)|/2$和表明,如果$G$是一个森林,然后$t(G) \geq |V(G)|/2 - 1$。

英文摘要:

A basic pigeonhole principle insures an existence of two objects of the same type if the number of objects is larger than the number of types. Can such a principle be extended to a more complex combinatorial structure? Here, we address such a question for graphs. We call two disjoint subsets $A, B$ of vertices \emph{\textbf{twins}} if they have the same cardinality and induce subgraphs of the same size. Let $t(G)$ be the largest $k$ such that $G$ has twins on $k$ vertices each. We provide the bounds on $t(G)$ in terms of the number of edges and vertices using discrepancy results for induced subgraphs. In addition, we give conditions under which $t(G)= |V(G)|/2$ and show that if $G$ is a forest then $t(G) \geq |V(G)|/2 - 1$.

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

↑