Asymptotic enumeration of non-uniform linear hypergraphs

DOI10.7151/dmgt.2246zbMath1479.05021OpenAlexW2983889056WikidataQ126845915 ScholiaQ126845915MaRDI QIDQ2062682

Mahdieh Hasheminezhad, Brendan D. McKay

Publication date: 3 January 2022

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2246

zbMATH Keywords

Steiner systemasymptotic enumerationlinear hypergraphswitching method

Mathematics Subject Classification ID

Hypergraphs (05C65) Enumeration in graph theory (05C30) Asymptotic enumeration (05A16)

Related Items (1)

Connectivity of the linear uniform hypergraph process

Cites Work

• Asymptotic enumeration of sparse uniform linear hypergraphs with given degrees
• Asymptotic enumeration of sparse 0--1 matrices with irregular row and column sums
• An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
• Asymptotic enumeration of linear hypergraphs with given number of vertices and edges
• Random methods in design theory: A survey

This page was built for publication: Asymptotic enumeration of non-uniform linear hypergraphs