Theorem 4.5. Assuming that:

$| V | = n$
$G$ a $Δ$ -intersecting family with vertex set $V$

Then

G

has size at most

2^{(\binom{n}{2}) - 2}