Bulky subgraphs of the hypercube (Q1568786)

Suppose \(Q\) is a \(d\)-dimensional hypercube on \(2^d\) vertices. The intersection of \(Q\) with one of the hyperplanes \(x_i= 0\) or \(x_i= 1\), \(i\in [1,2,\dots, d]\) is a \((d-1)\)-dimensional hypercube called a facet of \(Q\). A graph is bulky if it meets every facet of \(Q\) and is connected. An induced subgraph is said to be simple-majority if \(|G|> 2^{d-1}\). The author proves that every simple-majority \(G\) has a bulk subgraph.