Random hypergraph irregularity

Authors

Paul Balister, University of MemphisFollow
Béla Bollobás, University of MemphisFollow
Jeno Lehel, University of Memphis
MichaŁ Morayne, Wrocław University of Science and Technology

Abstract

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.

Publication Title

SIAM Journal on Discrete Mathematics

Recommended Citation

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