Asymptotic enumeration of sparse uniform hypergraphs with given degrees
From MaRDI portal
Publication:499481
DOI10.1016/j.ejc.2015.06.004zbMath1321.05116arXiv1306.2012OpenAlexW1850102257WikidataQ101496296 ScholiaQ101496296MaRDI QIDQ499481
Catherine Greenhill, Vladimir Blinovsky
Publication date: 30 September 2015
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1306.2012
Related Items (8)
Degree sequences of sufficiently dense random uniform hypergraphs ⋮ Asymptotic enumeration of sparse uniform linear hypergraphs with given degrees ⋮ Enumerating sparse uniform hypergraphs with given degree sequence and forbidden edges ⋮ Approximate counting of regular hypergraphs ⋮ Asymptotic enumeration of linear hypergraphs with given number of vertices and edges ⋮ On the number of linear multipartite hypergraphs with given size ⋮ The matching process and independent process in random regular graphs and hypergraphs ⋮ Asymptotic Enumeration of Hypergraphs by Degree Sequence
Cites Work
- Asymptotic enumeration of sparse 0--1 matrices with irregular row and column sums
- Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\)
- Asymptotic enumeration by degree sequence of graphs of high degree
- Probabilistic existence of regular combinatorial structures
- Approximate counting of regular hypergraphs
- Subgraphs of Dense Random Graphs with Specified Degrees
- Perfect Matchings in Random r-regular, s-uniform Hypergraphs
This page was built for publication: Asymptotic enumeration of sparse uniform hypergraphs with given degrees
