Random hypergraph irregularity
A hypergraph is k-irregular if there is no set of k vertices all of which have the same degree. We asymptotically determine the probability that a random uniform hypergraph is k-irregular.
SIAM Journal on Discrete Mathematics
Balister, P., Bollobás, B., Lehel, J., & Morayne, M. (2016). Random hypergraph irregularity. SIAM Journal on Discrete Mathematics, 30 (1), 465-473. https://doi.org/10.1137/120897717