Asymptotic enumeration of linear hypergraphs with given number of vertices and edges

DOI10.1016/j.aam.2020.102000zbMath1433.05159arXiv1908.06333OpenAlexW2998994549WikidataQ126350521 ScholiaQ126350521MaRDI QIDQ2300585

Fang Tian, Brendan D. McKay

Publication date: 27 February 2020

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

asymptotic enumerationlinear hypergraphswitching methodrandom hypergraph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Enumeration in graph theory (05C30) Asymptotic enumeration (05A16)

Related Items (4)

Connectivity of the linear uniform hypergraph process ⋮ Asymptotic linearity of binomial random hypergraphs via cluster expansion under graph-dependence ⋮ On the number of linear multipartite hypergraphs with given size ⋮ Asymptotic enumeration of non-uniform linear hypergraphs

Cites Work

• Asymptotic enumeration of sparse uniform linear hypergraphs with given degrees
• Asymptotic enumeration of sparse uniform hypergraphs with given degrees
• Asymptotic enumeration of sparse 0--1 matrices with irregular row and column sums
• Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums
• On a packing and covering problem
• Approximate counting of regular hypergraphs
• Random methods in design theory: A survey
• On the number of partial Steiner systems
• On the number of linear hypergraphs of large girth
• Asymptotic Enumeration of Sparse Multigraphs with Given Degrees
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations

This page was built for publication: Asymptotic enumeration of linear hypergraphs with given number of vertices and edges