It is well known that an intersecting family of subsets of an n-element set can contain at most 2n-1 sets. It is natural to wonder how 'close' to intersecting a family of size greater than 2n-1 can be. Katona, Katona and Katona introduced the idea of a 'most probably intersecting family'. Suppose that is a family and that 0 p be the random family formed by selecting each set in independently with probability p. A family is most probably intersecting if it maximizes the probability that p is intersecting over all families of size | |.
Katona, Katona and Katona conjectured that there is a nested sequence consisting of most probably intersecting families of every possible size. We show that this conjecture is false for every value of p provided that n is sufficiently large.
[1]
Gyula O. H. Katona,et al.
Most Probably Intersecting Families of Subsets
,
2012,
Comb. Probab. Comput..
[2]
Stephan Wagner,et al.
On a Problem of Ahlswede and Katona
,
2009
.
[3]
R. Ahlswede,et al.
Graphs with maximal number of adjacent pairs of edges
,
1978
.
[4]
Peter Frankl.
On the Minimum Number of Disjoint Pairs in a Family of Finite Sets
,
1977,
J. Comb. Theory, Ser. A.
[5]
Paul A. Russell.
Compressions and Probably Intersecting Families
,
2012,
Comb. Probab. Comput..
[6]
Rudolf Ahlswede,et al.
Simple hypergraphs with maximal number of adjacent pairs of edges
,
1980,
J. Comb. Theory, Ser. B.