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

随机无k匹配过程

The random k-matching-free process

Michael Krivelevich, Matthew Kwan, Po-Shen Loh, Benny Sudakov

摘要:

假设$\mathcal{P}$是通过去除边来保持的图形属性,并且考虑从空$n$顶点图形开始然后逐个添加边的随机图形过程,每个边都随机地均匀选择,受到不违反$\mathcal{P}$的约束。这些类型的随机过程在过去的20年里一直是广泛研究的主题,在极值组合学中有着惊人的应用,并导致了重要的概率工具的发现。本文考虑$k$ -无匹配过程,其中$\mathcal{P}$是不包含大小为$k$的匹配的性质.我们能够分析这个过程的广泛的$k$值的行为,特别是我们证明,如果$k=o(n)$或如果$n-2k=o(\sqrt{n}/\log n)$,那么这个过程很可能终止于一个$k$匹配的最大可能数量的边缘,其特征在于由Erdales和Gallai的图。我们还表明,这些界限上$k$基本上是最好的可能,我们朝着理解的中间制度的过程中的行为的第一步。

英文摘要:

Let $\mathcal{P}$ be a graph property which is preserved by removal of edges, and consider the random graph process that starts with the empty $n$-vertex graph and then adds edges one-by-one, each chosen uniformly at random subject to the constraint that $\mathcal{P}$ is not violated. These types of random processes have been the subject of extensive research over the last 20 years, having striking applications in extremal combinatorics, and leading to the discovery of important probabilistic tools. In this paper we consider the $k$-matching-free process, where $\mathcal{P}$ is the property of not containing a matching of size $k$. We are able to analyse the behaviour of this process for a wide range of values of $k$; in particular we prove that if $k=o(n)$ or if $n-2k=o(\sqrt{n}/\log n)$ then this process is likely to terminate in a $k$-matching-free graph with the maximum possible number of edges, as characterised by Erdős and Gallai. We also show that these bounds on $k$ are essentially best possible, and we make a first step towards understanding the behaviour of the process in the intermediate regime.

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

↑