Approximate counting of regular hypergraphs

DOI10.1016/j.ipl.2013.07.018zbMath1285.05092arXiv1303.0400OpenAlexW2111453434WikidataQ57401426 ScholiaQ57401426MaRDI QIDQ2445249

Andrzej Dudek, Matas Šileikis, Alan M. Frieze, Andrzej Ruciński

Publication date: 14 April 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1303.0400

zbMATH Keywords

combinatorial problemshypergraphsswitching

Mathematics Subject Classification ID

Hypergraphs (05C65) Enumeration in graph theory (05C30)

Related Items

Degree sequences of sufficiently dense random uniform hypergraphs, Asymptotic enumeration of sparse uniform linear hypergraphs with given degrees, On vertex independence number of uniform hypergraphs, A heuristic technique for decomposing multisets of non-negative integers according to the Minkowski sum, Spanning structures and universality in sparse hypergraphs, Loose Hamilton Cycles in Regular Hypergraphs, Enumerating sparse uniform hypergraphs with given degree sequence and forbidden edges, Approximate counting of regular hypergraphs, Sampling hypergraphs with given degrees, Asymptotic enumeration of sparse uniform hypergraphs with given degrees, A threshold result for loose Hamiltonicity in random regular uniform hypergraphs, On universal hypergraphs, Asymptotic enumeration of linear hypergraphs with given number of vertices and edges, Asymptotic Enumeration of Hypergraphs by Degree Sequence

Cites Work

• Unnamed Item
• Asymptotic enumeration of sparse uniform hypergraphs with given degrees
• Loose Hamilton cycles in random uniform hypergraphs
• The asymptotic distribution of short cycles in random regular graphs
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\)
• The asymptotic number of labeled graphs with given degree sequences
• Approximate counting of regular hypergraphs
• Uniform generation of random regular graphs of moderate degree
• Perfect Matchings in Random r-regular, s-uniform Hypergraphs
• Hamilton Cycles in Random Graphs with a Fixed Degree Sequence