Discrete Math - Going over the 10.5 HW on Graph Theory

Поділитися
Вставка
  • Опубліковано 6 лис 2024

КОМЕНТАРІ • 3

  • @dodecahedra
    @dodecahedra  Рік тому

    @36:16 This graph can be colored with just three colors! I was just too dumb to figure it out. Moral of the story... we should probably develop some algorithms for this.

  • @dodecahedra
    @dodecahedra  Рік тому

    @32:17 Our author, Eric Gossett, defines W₅ as the wheel graph with 5 vertices, so that top graph is W₅ and the bottom graph is W₆. So using this notation Χ(Wₙ) = 3 if n is odd, and Χ(Wₙ) = 4 if n is even, contrary to what was said in the video.

  • @felslayer2750
    @felslayer2750 2 роки тому

    Hey! This video really helped me! -Neel Jay