An even cycle is bipartite and has chromatic number two. An odd cycle has chromatic number three. The extremal-density theorem therefore gives
(1)
For odd cycles the complete balanced bipartite graph also exhibits the matching asymptotic lower density one half.

Ancestors (12)

  1. 4
  2. A
  3. 2007
  4. Past exam of the graph Theory and Probabilistic Combinatorics course of the University of Oxford
  5. Graph Theory and Probabilistic Combinatorics course of the University of Oxford
  6. Year 4 of the mathematics course of the University of Oxford
  7. Mathematics course of the University of Oxford
  8. Undergraduate course of the University of Oxford
  9. Course of the University of Oxford
  10. University of Oxford
  11. List of universities
  12. 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