Both are bipartite. Partition the vertices by parity of the number of one bits. A cube edge changes one bit and an interior diagonal changes three bits, so both types join opposite parity classes. In fact is : from any vertex its three cube neighbors and its opposite vertex exhaust the four vertices of opposite parity.

Ancestors (14)

  1. c
  2. iv
  3. 2
  4. R
  5. 2008
  6. Past exam of the Probability, statistics and options II course of the University of Oxford
  7. Probability, statistics and options II course of the University of Oxford
  8. Year 2 of the mathematics and statistics course of the University of Oxford
  9. Mathematics and statistics course of the University of Oxford
  10. Undergraduate course of the University of Oxford
  11. Course of the University of Oxford
  12. University of Oxford
  13. List of universities
  14. Home

View article source

Discussion (0) New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version