Combinatorics: set systems, hypergraphs, families of vectors, and combinatorial probability
Combinatorics: set systems, hypergraphs, families of vectors, and combinatorial probability
Models of random partial orders
Surveys in combinatorics, 1993
Sperner theory
Small sublattices in random subsets of Boolean lattices
proceedings of the eighth international conference on Random structures and algorithms
The length of random subsets of Boolean lattices
Random Structures & Algorithms
Maximum antichains in random subsets of a finite set
Journal of Combinatorial Theory Series A
Random Finite Topologies and their Thresholds
Combinatorics, Probability and Computing
| Hi-index | 0.00 |
Suppose we toss an independent coin with probability of success p for each subset of [n] = { 1,..., n}, and form the random hypergraph P(n,p) by taking as hyperedges the subsets with successful coin tosses. We investigate the cardinality of the largest Sperner family contained in P(n,p). We obtain a sharp result for the range of p = p(n) in which this Sperner family has cardinality comparable to the cardinality of P(n,p).