The <a href="https://en.wikipedia.org/wiki/Intersection_graph" class="extiw" title="en:Intersection graph">intersection graph</a> of the edges of a cube. Equivalently, a graph in which the vertices represent two-bit samples of a 3-bit bitstring. Induced subgraphs of analogously defined graphs for larger numbers of bits play a key role in proofs of <a href="https://en.wikipedia.org/wiki/Hardness_of_approximation" class="extiw" title="en:Hardness of approximation">hardness of approximation</a> for the <a href="https://en.wikipedia.org/wiki/Clique_problem" class="extiw" title="en:Clique problem">clique problem</a>.
<a href="//commons.wikimedia.org/wiki/User:David_Eppstein" class="mw-redirect" title="User:David Eppstein">David Eppstein</a>
<span class="int-own-work" lang="en">Own work</span>, <a rel="nofollow" class="external free" href="https://11011110.github.io/blog/2009/03/21/procrastination-and-subcubes.html">https://11011110.github.io/blog/2009/03/21/procrastination-and-subcubes.html</a>