Asymptotic enumeration of sparse uniform linear hypergraphs with given degrees
From MaRDI portal
Publication:311513
zbMath1344.05073arXiv1409.1314MaRDI QIDQ311513
Catherine Greenhill, Vladimir Blinovsky
Publication date: 13 September 2016
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1409.1314
Related Items
Degree sequences of sufficiently dense random uniform hypergraphs ⋮ Global eigenvalue fluctuations of random biregular bipartite graphs ⋮ Unnamed Item ⋮ Enumerating sparse uniform hypergraphs with given degree sequence and forbidden edges ⋮ Lower bounds on Tuza constants for transversals in linear uniform hypergraphs ⋮ Sampling hypergraphs with given degrees ⋮ Asymptotic enumeration of linear hypergraphs with given number of vertices and edges ⋮ On the number of linear multipartite hypergraphs with given size ⋮ Asymptotic enumeration of non-uniform linear hypergraphs ⋮ Asymptotic Enumeration of Hypergraphs by Degree Sequence
Cites Work
- Unnamed Item
- Unnamed Item
- Asymptotic enumeration of sparse uniform hypergraphs with given degrees
- Asymptotic enumeration of sparse 0--1 matrices with irregular row and column sums
- Intersection graphs of k-uniform linear hypergraphs
- Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\)
- Short cycles in random regular graphs
- Asymptotic enumeration by degree sequence of graphs of high degree
- Randomly coloring simple hypergraphs
- Approximate counting of regular hypergraphs
- Subgraphs of Dense Random Graphs with Specified Degrees
- Coloring uniform hypergraphs with few edges
- Properly 2-Colouring Linear Hypergraphs
- Perfect Matchings in Random r-regular, s-uniform Hypergraphs
- Asymptotic Enumeration of Sparse Multigraphs with Given Degrees
- Probabilistic existence of rigid combinatorial structures
