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

拟随机超图的完美填充

Perfect Packings in Quasirandom Hypergraphs

John Lenz, Dhruv Mubayi

摘要:

设k >= 2,F是v个顶点的线性k一致超图。我们证明,如果n足够大,v| n,则每一个具有最小度和常边密度的n阶拟随机k-一致超图$Ω(n^{k-1})$允许完美F-填充. k = 2的情况直接由科姆洛斯、萨尔科齐和塞梅雷迪的爆破引理得出。我们还证明了一些非线性F的积极结果,但在同一时间给出反例,而简单的F是接近线性的。最后,我们解决的情况下,密度趋于零,并证明(在类比图的情况下),稀疏拟随机3-均匀超图承认完美匹配,只要他们的第二大特征值是足够小于的最大特征值。

英文摘要:

Let k >= 2 and F be a linear k-uniform hypergraph with v vertices. We prove that if n is sufficiently large and v|n, then every quasirandom k-uniform hypergraph on n vertices with constant edge density and minimum degree $Ω(n^{k-1})$ admits a perfect F-packing. The case k = 2 follows immediately from the blowup lemma of Komlós, Sárközy, and Szemerédi. We also prove positive results for some nonlinear F but at the same time give counterexamples for rather simple F that are close to being linear. Finally, we address the case when the density tends to zero, and prove (in analogy with the graph case) that sparse quasirandom 3-uniform hypergraphs admit a perfect matching as long as their second largest eigenvalue is sufficiently smaller than the largest eigenvalue.

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

↑