Enumeration of intersecting families
From MaRDI portal
If \(n=[n/2]\) then the base 2 logarithm of the number of maximal intersecting families on \(m\) elements is asymptotically \(\left(\frac{m-1}{n-1}\right)\). The upper bound is deduced from an estimate by Kleitman-Markowsky on the number of Sperner systems.
Recommendations
- Counting families of mutually intersecting sets
- On the representing number of intersecting families
- Counting intersecting and pairs of cross-intersecting families
- Intersecting families of permutations
- Intersecting families of permutations
- scientific article; zbMATH DE number 3948273
- Non-trivial intersecting families
- On the union of intersecting families
- Multiply-intersecting families revisited
- Setwise intersecting families of permutations
Cites work
Cited in
(15)- Coloring graphs with locally few colors
- Finite algebras with large free spectra
- Maximal intersecting families
- Counting families of mutually intersecting sets
- On the structure of minimal winning coalitions in simple voting games
- Chain intersecting families
- scientific article; zbMATH DE number 5535209 (Why is no real title available?)
- scientific article; zbMATH DE number 3948273 (Why is no real title available?)
- Maximal independent sets in the covering graph of the cube
- Chromatic numbers of copoint graphs of convex geometries
- scientific article; zbMATH DE number 4195958 (Why is no real title available?)
- Intersecting families of permutations
- Intersecting families of permutations
- On the size of maximal intersecting families
- Doubly commuting invariant subspaces of \(L^2(\mathbb{T}^n)\) and \(L^2(\mathbb{R}^n)\)
This page was built for publication: Enumeration of intersecting families
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q787169)
