Asymptotic Enumeration of Non-Uniform Linear Hypergraphs
A linear hypergraph, also known as a partial Steiner system, is a collection of subsets of a set such that no two of the subsets have more than one element in common. Most studies of linear hypergraphs consider only the uniform case, in which all the subsets have the same size. In this paper we prov...
Main Authors: | Hasheminezhad Mahdieh, McKay Brendan D. |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Zielona Góra
2022-02-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.2246 |
Similar Items
-
Cyclic Partitions of Complete and Almost Complete Uniform Hypergraphs
by: Dilbarjot, et al.
Published: (2022-08-01) -
Niche Hypergraphs of Products of Digraphs
by: Sonntag Martin, et al.
Published: (2020-02-01) -
On characterization of finite modules by hypergraphs
by: Hamzekolaee Ali Reza Moniri, et al.
Published: (2022-02-01) -
On the Sizes of (k, l)-Edge-Maximal r-Uniform Hypergraphs
by: Tian Yingzhi, et al.
Published: (2023-02-01) -
On the α-Spectral Radius of Uniform Hypergraphs
by: Guo Haiyan, et al.
Published: (2020-05-01)