Each hyperedge slot is filled independently and uniformly from 1 through n, with no rejection sampling: the result can contain repeated vertices within a hyperedge, duplicate hyperedges, and can be disconnected.
▪
The result is
Hypergraph[Range[n],edges]
: all n vertices stay in the vertex list even if some never appear in an edge, unlike