Most probably intersecting families of subsets
From MaRDI portal
Recommendations
Cites work
Cited in
(16)- Partition-free families of sets
- Inverse problems of the Erdős-Ko-Rado type theorems for families of vector spaces and permutations
- Most probably intersecting hypergraphs
- Intersecting P-free families
- Structure and supersaturation for intersecting families
- Removal and stability for Erdős-Ko-Rado
- Compressions and probably intersecting families
- A simple removal lemma for large nearly-intersecting families
- Probabilities for Intersecting Systems and Random Subsets of Finite Sets
- Probably intersecting families are not nested
- The minimum number of disjoint pairs in set systems and related problems
- Set systems containing many maximal chains
- Most-intersection of countable sets
- The number of disjoint pairs in families of k-element subsets
- Maximal degrees in subgraphs of Kneser graphs
- Interview with Gyula O. H. Katona
This page was built for publication: Most probably intersecting families of subsets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2883864)