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

三角形相交图族

Triangle-Intersecting Families of Graphs

David Ellis, Yuval Filmus, Ehud Friedgut

摘要:

一个图族F称为三角形相交的,如果对F中的任意两个图G,H,G和H的交包含一个三角形。Simonovits和Sos在1976年的一个猜想指出,在一个固定的n个顶点的集合上的最大的三角形相交图族是通过固定一个特定的三角形并取所有包含它的图,得到一个大小为(1/8)2^{n choose 2}的图族。我们证明了这个猜想和一些推广(例如,我们证明了同样是真的奇循环相交的家庭,我们得到最好的可能界限的大小家庭根据不同的,不一定是统一的,措施)。我们还得到了稳定性结果,表明几乎最大的三角形相交的家庭有近似相同的结构。

英文摘要:

A family of graphs F is said to be triangle-intersecting if for any two graphs G,H in F, the intersection of G and H contains a triangle. A conjecture of Simonovits and Sos from 1976 states that the largest triangle-intersecting families of graphs on a fixed set of n vertices are those obtained by fixing a specific triangle and taking all graphs containing it, resulting in a family of size (1/8) 2^{n choose 2}. We prove this conjecture and some generalizations (for example, we prove that the same is true of odd-cycle-intersecting families, and we obtain best possible bounds on the size of the family under different, not necessarily uniform, measures). We also obtain stability results, showing that almost-largest triangle-intersecting families have approximately the same structure.

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

↑