File:Cube-face-intersection-graph.svg
Summary
| Description |
English: The intersection graph 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 hardness of approximation for the clique problem. |
| Date | |
| Source | Own work, https://11011110.github.io/blog/2009/03/21/procrastination-and-subcubes.html |
| Author | David Eppstein |
Licensing
 |
I, the copyright holder of this work, release this work into the public domain. This applies worldwide. In some countries this may not be legally possible; if so: I grant anyone the right to use this work for any purpose, without any conditions, unless such conditions are required by law. |
