Counting partitions of $ {G}_{n,1/2} $ with degree congruence conditions
For $G=G_{n, 1/2}$, the Erd\H{o}s--Renyi random graph, let $X_n$ be the random variable representing the number of distinct partitions of $V(G)$ into sets $A_1, \ldots, A_q$ so that the degree of each vertex in $G[A_i]$ is divisible by $q$ for all $i\in[q]$. We prove that if $q\geq 3$ is odd then $X...
| Main Authors: | , , , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
Wiley
2022
|