Theorem 4.15
(Marcus, Spielman, Srivastava)
.
Assuming that:
d
≥
3
Then
there are
(
n
,
d
,
2
d
−
1
)
-bipartite graphs for arbitrarily large
n
.