Repeated degrees in random uniform hypergraphs
We prove that in a random 3-uniform or 4-uniform hypergraph of order n the probability that some two vertices have the same degree tends to one as n → ∞. © 2013 Society for Industrial and Applied Mathematics.
SIAM Journal on Discrete Mathematics
Balister, P., Bollobás, B., Lehel, J., & Morayne, M. (2013). Repeated degrees in random uniform hypergraphs. SIAM Journal on Discrete Mathematics, 27 (1), 145-154. https://doi.org/10.1137/100785156