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

稀疏伪随机图中的团因子

Clique-factors in sparse pseudorandom graphs

University of Rhode Island(罗德岛大学);Universidade de São Paulo(圣保罗大学);Freie Universität Berlin(柏林自由大学);Technische Universität Ilmenau(伊尔梅瑙工业大学)

Jie Han, Yoshiharu Kohayakawa, Patrick Morris, Yury Person

AI总结:

证明对于任意t≥3,存在常数c>0和n0,使得任何d-正则n顶点图G,若t整除n且n≥n0,且第二大特征值绝对值λ满足λ≤c d^t/n^{t-1},则G包含一个K_t-因子。

摘要:

我们证明对于任意$t\ge 3$,存在常数$c>0$和$n_0$,使得任何$d$-正则$n$顶点图$G$,若$t\mid n\geq n_0$且第二大特征值绝对值$\lambda$满足$\lambda\le c d^{t}/n^{t-1}$,则$G$包含一个$K_t$-因子,即覆盖$G$所有顶点的顶点不交的$K_t$副本。该结果推广到由Thomason在八十年代引入的混合图的更广泛设置中。

英文摘要:

We prove that for any $t\ge 3$ there exist constants $c>0$ and $n_0$ such that any $d$-regular $n$-vertex graph $G$ with $t\mid n\geq n_0$ and second largest eigenvalue in absolute value $λ$ satisfying $λ\le c d^{t}/n^{t-1}$ contains a $K_t$-factor, that is, vertex-disjoint copies of $K_t$ covering every vertex of $G$. The result generalizes to broader setting of jumbled graphs, which were introduced by Thomason in the eighties.

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

↑