On the number of linear multipartite hypergraphs with given size

DOI10.1007/s00373-021-02370-1zbMath1479.05246arXiv2107.04950OpenAlexW3185898909MaRDI QIDQ2053710

Fang Tian

Publication date: 30 November 2021

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

asymptotic enumerationlinear hypergraphswitching methodmultipartite hypergraph

Mathematics Subject Classification ID

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

Related Items (2)

Connectivity of the linear uniform hypergraph process ⋮ Unnamed Item

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 linear hypergraphs with given number of vertices and edges
• Random methods in design theory: A survey
• On the number of partial Steiner systems
• On the number of linear hypergraphs of large girth

This page was built for publication: On the number of linear multipartite hypergraphs with given size