On the number of linear multipartite hypergraphs with given size

DOI10.1007/S00373-021-02370-1MaRDI QIDQ2053710zbMATH OpenOpenAlexFDO

Authors 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 hypergraphmultipartite hypergraphswitching method

Mathematics Subject Classification ID

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

Abstract: For any given integer $rgeqslant3$, let $k=k(n)$ be an integer with $rleqslantkleqslantn$. A hypergraph is $r$-uniform if each edge is a set of $r$ vertices, and is said to be linear if two edges intersect in at most one vertex. Let $A_1,ldots,A_k$ be a given $k$-partition of $[n]$ with $|A_i|=n_{i}geqslant1$. An $r$-uniform hypergraph $H$ is called {it $k$-partite} if each edge $e$ satisfies $|ecap{A}_i|leqslant1$ for $1leqslantileqslantk$. In this paper, the number of linear $k$-partite $r$-uniform hypergraphs on $noinfty$ vertices is determined asymptotically when the number of edges is $m(n)=o(n^{frac43})$. For $k=n$, it is the number of linear $r$-uniform hypergraphs on vertex set $[n]$ with $m=o(n^{frac43})$ edges.

Recommendations

• Asymptotic enumeration of linear hypergraphs with given number of vertices and edges
• Decomposition of the complete r-graph into complete r-partite r-graphs
• Asymptotic enumeration of non-uniform linear hypergraphs
• On judicious partitions of uniform hypergraphs
• Judicious partitions of hypergraphs

Cites work

• Asymptotic enumeration of linear hypergraphs with given number of vertices and edges
• Asymptotic enumeration of sparse 0--1 matrices with irregular row and column sums
• Asymptotic enumeration of sparse uniform hypergraphs with given degrees
• Asymptotic enumeration of sparse uniform linear hypergraphs with given degrees
• On the number of linear hypergraphs of large girth
• On the number of partial Steiner systems
• Random methods in design theory: A survey

Cited in

(5)

• Partitioning ordered hypergraphs
• Asymptotic enumeration of non-uniform linear hypergraphs
• Connectivity of the linear uniform hypergraph process
• Asymptotic enumeration of linear hypergraphs with given number of vertices and edges
• On the random greedy linear uniform hypergraph packing

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

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