Asymptotic enumeration of sparse uniform hypergraphs with given degrees

DOI10.1016/J.EJC.2015.06.004zbMATH Open1321.05116DBLPjournals/ejc/BlinovskyG16arXiv1306.2012OpenAlexW1850102257WikidataQ101496296 ScholiaQ101496296MaRDI QIDQ499481FDOQ499481

Catherine Greenhill, Vladimir Blinovsky

Publication date: 30 September 2015

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Abstract: Let $rgeq2$ be a fixed integer. For infinitely many $n$, let $$ be a vector of nonnegative integers such that their sum $M$ is divisible by $r$. We present an asymptotic enumeration formula for simple $r$-uniform hypergraphs with degree sequence $k$. (Here "simple" means that all edges are distinct and no edge contains a repeated vertex.) Our formula holds whenever the maximum degree $k_{mathrmmax}$ satisfies $k_{mathrmmax}^3=o(M)$.

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

Recommendations

• Asymptotic enumeration of sparse uniform linear hypergraphs with given degrees
• Asymptotic enumeration of sparse multigraphs with given degrees
• Asymptotic enumeration of sparse graphs with a minimum degree constraint
• Asymptotic Enumeration of Hypergraphs by Degree Sequence
• Enumerating sparse uniform hypergraphs with given degree sequence and forbidden edges
• Asymptotic enumeration of sparse 2-connected graphs
• Asymptotic enumeration of non-uniform linear hypergraphs
• Asymptotic enumeration of graphs with given degree sequence
• The asymptotic number of connected \(d\)-uniform hypergraphs

zbMATH Keywords

asymptotic enumeration formula

Mathematics Subject Classification ID

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

Cites Work

• Perfect Matchings in Random r-regular, s-uniform Hypergraphs
• Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\)
• Asymptotic enumeration by degree sequence of graphs of high degree
• Approximate counting of regular hypergraphs
• Subgraphs of Dense Random Graphs with Specified Degrees
• Asymptotic enumeration of sparse 0--1 matrices with irregular row and column sums
• Probabilistic existence of regular combinatorial structures

Cited In (9)

• Asymptotic enumeration of sparse 2-connected graphs
• Degree sequences of sufficiently dense random uniform hypergraphs
• Asymptotic enumeration of sparse uniform linear hypergraphs with given degrees
• Asymptotic Enumeration of Hypergraphs by Degree Sequence
• On the number of linear multipartite hypergraphs with given size
• Enumerating sparse uniform hypergraphs with given degree sequence and forbidden edges
• Asymptotic enumeration of linear hypergraphs with given number of vertices and edges
• The matching process and independent process in random regular graphs and hypergraphs
• Approximate counting of regular hypergraphs

This page was built for publication: Asymptotic enumeration of sparse uniform hypergraphs with given degrees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q499481)