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.
['Paul Balister', 'Béla Bollobás', 'Jenö Lehel', 'Michał Morayne']
Random Hypergraph Irregularity