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

随机图中的大规模结构

Large-scale structures in random graphs

Julia Böttcher

摘要:

近年来,图论在以下类型的问题上取得了很大进展。在随机图中出现某个大型子结构的阈值是多少?什么时候一个随机图包含来自给定族的所有结构?什么时候它包含了如此强大的它们,以至于即使允许干扰图的对手也不能摧毁所有的它们?我将概述这一进展,并强调一些新发展的方法,如稀疏正则性方法,吸收方法和容器方法所发挥的重要作用。我还将提及这方面仍然存在的许多未决问题。

英文摘要:

In recent years there has been much progress in graph theory on questions of the following type. What is the threshold for a certain large substructure to appear in a random graph? When does a random graph contain all structures from a given family? And when does it contain them so robustly that even an adversary who is allowed to perturb the graph cannot destroy all of them? I will survey this progress, and highlight the vital role played by some newly developed methods, such as the sparse regularity method, the absorbing method, and the container method. I will also mention many open questions that remain in this area.

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

↑