| Autor: |
VAKHRUSHEV, STEPAN, ZHUKOVSKII, MAKSIM |
| Předmět: |
|
| Zdroj: |
SIAM Journal on Discrete Mathematics; 2024, Vol. 38 Issue 3, p2468-2488, 21p |
| Abstrakt: |
It is known that after an appropriate rescaling the maximum degree of the binomial random graph converges in distribution to a Gumbel random variable. The same holds true for the maximum number of common neighbors of a k-vertex set and for the maximum number of s-cliques sharing a single vertex. Can these results be generalized to the maximum number of extensions of a k-vertex set for any given way of extending a k-vertex set by an s-vertex set? In this paper, we generalize the abovementioned results to a class of "symmetric extensions" and show that the limit distribution is not necessarily from the Gumbel family. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
