Asymptotical Estimations for the Number of Cliques of Uniform Hypergraphs
From MaRDI portal
Publication:3960736
DOI10.1016/S0304-0208(08)73475-3zbMath0497.05048OpenAlexW92138857MaRDI QIDQ3960736
Publication date: 1981
Published in: North-Holland Mathematics Studies (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-0208(08)73475-3
Hypergraphs (05C65) Enumeration in graph theory (05C30) Combinatorial probability (60C05) Algorithms in computer science (68W99)
Related Items
Probabilistic analysis of strong hypergraph coloring algorithms and the strong chromatic number ⋮ Component structure in the evolution of random hypergraphs