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

一个关于星星和派系的故事

A tale of stars and cliques

Tomasz Łuczak, Joanna Polcyn, Christian Reiher

摘要:

本文证明了对于无穷多个自然数$k$,存在$k$ -一致超图,它允许[9]中描述的“重标度现象”.更精确地说,让$\mathcal{A}(k,I, n)$表示一类$k$ -图的$n$顶点,其中所有成对交叉的边缘属于一个集合$I$的大小。我们证明了,如果$k=rt^2$对于某些$r\ge 1$和$t\ge 2$,并且~ $I$以某种特殊的方式被选择,那么$\mathcal{A}(rt^2,I, n)$中的拓扑图要么被大度数的星所支配,要么基本上是“$t$ -厚”的$rt^2$ -图,其中顶点被划分成$t$顶点的组,每条边都是$tr$这样的组的并集.很容易看出,与恒星不同,$t$厚图的最大度比它的边数低。因此,如果我们研究图从$\mathcal{A}(rt^2,I, n)$与规定数量的边缘$m$最小化的最大程度,周围的$m$的值,这是最大的$t$厚图的边缘数,可以观察到一个快速的,不连续的相变。有趣的是,这两类$k$ -图决定了$\mathcal{A}(rt^2,I, n)$中所有超图的结构。也就是说,我们表明,每个这样的超图可以分解成一个$t$厚图$H_T$,一个特殊的收集$H_S$的明星,和一个稀疏的“遗留”图$H_R$。

英文摘要:

We show that for an infinitely many natural numbers $k$ there are $k$-uniform hypergraphs which admit a `rescaling phenomenon' as described in [9]. More precisely, let $\mathcal{A}(k,I, n)$ denote the class of $k$-graphs on $n$ vertices in which the sizes of all pairwise intersections of edges belong to a set $I$. We show that if $k=rt^2$ for some $r\ge 1$ and $t\ge 2$, and~$I$ is chosen in some special way, the densest graphs in $\mathcal{A}(rt^2,I, n)$ are either dominated by stars of large degree, or basically, they are `$t$-thick' $rt^2$-graphs in which vertices are partitioned into groups of $t$ vertices each and every edge is a union of $tr$ such groups. It is easy to see that, unlike in stars, the maximum degree of $t$-thick graphs is of a lower order than the number of its edges. Thus, if we study the graphs from $\mathcal{A}(rt^2,I, n)$ with a prescribed number of edges $m$ which minimize the maximum degree, around the value of $m$ which is the number of edges of the largest $t$-thick graph, a rapid, discontinuous phase transition can be observed. Interestingly, these two types of $k$-graphs determine the structure of all hypergraphs in $\mathcal{A}(rt^2,I, n)$. Namely, we show that each such hypergraph can be decomposed into a $t$-thick graph $H_T$, a special collection $H_S$ of stars, and a sparse `left-over' graph $H_R$.

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

↑