  A 1992 conjecture of Alon and Spencer says, roughly, that the ordinary random
graph $G_{n,1/2}$ typically admits a covering of a constant fraction of its
edges by edge-disjoint, nearly maximum cliques. We show that this is not the
case. The disproof is based on some (partial) understanding of a more basic
question: for $k\ll \sqrt{n}$ and $A_1\dots A_t$ chosen uniformly and
independently from the $k$-subsets of $\{1\dots n\}$, what can one say about \[
\mathbb{P}(|A_i\cap A_j|\leq 1 ~\forall i\neq j)? \] Our main concern is trying
to understand how closely the answers to this and a related question about
matchings follow heuristics gotten by pretending that certain (dependent)
choices are made independently.
