Asymptotic Enumeration of Hypergraphs by Degree Sequence
From MaRDI portal
Publication:5871279
DOI10.19086/aic.32357zbMath1506.05016arXiv2008.07757v2OpenAlexW4210593577MaRDI QIDQ5871279
Nina Kamčev, Anita Liebenau, Nicholas C. Wormald
Publication date: 18 January 2023
Published in: Advances in Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.07757v2
Related Items
Sandwiching biregular random graphs, Degree sequences of sufficiently dense random uniform hypergraphs, Probabilistic existence of regular combinatorial structures, On the mixing time of the Diaconis-Gangolli random walk on contingency tables over \(\mathbb{Z}/q\mathbb{Z} \), On anti-stochastic properties of unlabeled graphs, Friendly bisections of random graphs, Factorisation of the complete bipartite graph into spanning semiregular factors, Subgraph distributions in dense random regular graphs, Lower bounds for contingency tables via Lorentzian polynomials, Uniform generation of spanning regular subgraphs of a dense graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Asymptotic enumeration of sparse uniform linear hypergraphs with given degrees
- Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity
- Estimating the number of zero-one multi-way tables via sequential importance sampling
- New results on degree sequences of uniform hypergraphs
- Asymptotic enumeration of sparse uniform hypergraphs with given degrees
- Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\)
- The asymptotic number of labeled graphs with given degree sequences
- Asymptotic enumeration by degree sequence of graphs of high degree
- A threshold result for loose Hamiltonicity in random regular uniform hypergraphs
- Probabilistic existence of regular combinatorial structures
- Approximate counting of regular hypergraphs
- The degree sequence of a random graph. I. The models
- Perfect Matchings in Random r-regular, s-uniform Hypergraphs
