Random cliques in random graphs and sharp thresholds for F-factors
<p>We show that for each r ≥ 4, in a density range extending up to, and slightly beyond, the threshold for a Kr-factor, the copies of Kr in the random graph G(n, p) are randomly distributed, in the (one-sided) sense that the hypergraph that they form contains a copy of a binomial random...
| Huvudupphovsman: | |
|---|---|
| Materialtyp: | Journal article |
| Språk: | English |
| Publicerad: |
Wiley
2022
|