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

渗流扩张子中的长环

Long cycles in percolated expanders

Maurício Collares, Sahar Diskin, Joshua Erde, Michael Krivelevich

AI总结:

本文研究渗流扩张子中的长路径与长环存在性问题,通过图的扩张性条件证明了特定概率下随机子图不含指定长度路径和环的概率为指数小,并给出其在最大密度$K_{s,t}$-自由图中的应用。

摘要:

给定图$G$和概率$p$,我们通过以概率$p$独立保留$G$的每条边来构造随机子图$G_p$。给定$d\in\bN$以及常数$0<c<1$、$\bvarepsilon>0$,我们证明:若每个大小恰好为$\frac{c|V(G)|}{d}$的子集$S\bseteq V(G)$都满足$|N(S)|\bge d|S|$且$p=\frac{1+\bvarepsilon}{d}$,则$G_p$不包含长度为$\bOmega(\bvarepsilon^2c^2|V(G)|)$的环的概率是$|V(G)|$的指数小量。作为中间步骤,我们还证明:给定$k,d\bN$以及常数$\bvarepsilon>0$,若每个大小恰好为$k$的子集$S\bseteq V(G)$都满足$|N(S)|\bge kd$且$p=\frac{1+\bvarepsilon}{d}$,则$G_p$不包含长度为$\bOmega(\bvarepsilon^2 kd)$的路径的概率是指数小的。我们进一步讨论了这些结果在最大密度的$K_{s,t}$-自由图中的应用。

英文摘要:

Given a graph $G$ and probability $p$, we form the random subgraph $G_p$ by retaining each edge of $G$ independently with probability $p$. Given $d\in\mathbb{N}$ and constants $0<c<1, \varepsilon>0$, we show that if every subset $S\subseteq V(G)$ of size exactly $\frac{c|V(G)|}{d}$ satisfies $|N(S)|\ge d|S|$ and $p=\frac{1+\varepsilon}{d}$, then the probability that $G_p$ does not contain a cycle of length $Ω(\varepsilon^2c^2|V(G)|)$ is exponentially small in $|V(G)|$. As an intermediate step, we also show that given $k,d\in \mathbb{N}$ and a constant $\varepsilon>0$, if every subset $S\subseteq V(G)$ of size exactly $k$ satisfies $|N(S)|\ge kd$ and $p=\frac{1+\varepsilon}{d}$, then the probability that $G_p$ does not contain a path of length $Ω(\varepsilon^2 kd)$ is exponentially small. We further discuss applications of these results to $K_{s,t}$-free graphs of maximal density.

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

↑