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

给定边密度的图中奇数阶路径

Paths of Odd Order in Graphs with Given Edge Density

Yuyao Yang, Jiasheng Zeng

AI总结:

研究给定边密度的图中奇数阶路径\(P_{2r + 1}\)的渐近最大数量,通过简化问题到阈值图子和端点族,利用伯恩斯坦展开论证,给出不同边密度范围的最大值公式,扩展了相关定理。

摘要:

我们确定了具有规定边密度的图中未标记的\(P_{2r + 1}\)(\(r\geq1\)固定,\(P_{2r + 1}\)表示具有\(2r + 1\)个顶点的路径)副本的渐近最大数量。对于边密度\(c = 2e(G)/n^2\)的\(n\)顶点图\(G\),当\(0 < c\leq c_r\)时,最大值为\(\frac{1}{2}S_r(c)n^{2r + 1}+O(n^{2r})\);当\(c_r\leq c < 1\)时,最大值为\(\frac{1}{2}c^{r + 1/2}n^{2r + 1}+O(n^{2r})\),其中\(S_r(c)\)由拟星构造给出,\(c_r\in(0,1)\)是明确的代数转变点。证明将问题简化为阈值图子,再到两个端点族。三步端点通过将所需不等式简化为伯恩斯坦展开中的系数非负性来处理,这通过直接组合论证证明。此结果扩展了Ahlswede和Katona关于\(P_3\)的拟星与拟团定理以及Nagy关于\(P_5\)的定理到所有奇数个顶点的路径。

英文摘要:

We determine the asymptotic maximum number of unlabelled copies of $P_{2r+1}$ in graphs with prescribed edge density, where $r\ge1$ is fixed and $P_{2r+1}$ denotes the path on $2r+1$ vertices. If an $n$ vertex graph $G$ has edge density $c=2e(G)/n^2$, then the maximum is $\frac12S_r(c)n^{2r+1}+O(n^{2r})$ for $0<c\le c_r$, and $\frac12c^{r+1/2}n^{2r+1}+O(n^{2r})$ for $c_r\le c<1$, where $S_r(c)$ is the value given by the quasi-star construction and $c_r\in(0,1)$ is an explicit algebraic transition point. Thus the quasi-star construction is asymptotically extremal below the transition, while the quasi-clique construction is asymptotically extremal above the transition. This extends the quasi-star versus quasi-clique theorem of Ahlswede and Katona for $P_3$ and the theorem of Nagy for $P_5$ to all paths with an odd number of vertices. The proof reduces the problem to threshold graphons and then to two endpoint families. The three-step endpoint is handled by reducing the required inequality to coefficient nonnegativity in a Bernstein expansion, which is proved by a direct combinatorial argument.

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

↑