Edge Colorings and Chromatic Index of Graphs | Graph Theory

Поделиться
HTML-код
  • Опубликовано: 12 сен 2024

Комментарии • 28

  • @WrathofMath
    @WrathofMath  3 года назад +2

    Support the production of this course by joining Wrath of Math as a Channel Member for exclusive and early videos, original music, and upcoming lecture notes for the graph theory series! Plus your comments will be highlighted for me so it is more likely I'll answer your questions!
    ruclips.net/channel/UCyEKvaxi8mt9FMc62MHcliwjoin
    Graph Theory course: ruclips.net/p/PLztBpqftvzxXBhbYxoaZJmnZF6AUQr1mH
    Graph Theory exercises: ruclips.net/p/PLztBpqftvzxXtYASoshtU3yEKqEmo1o1L

  • @alejandrorz6577
    @alejandrorz6577 3 года назад +5

    Just waiting for the Vizing's theorem video, the proof of that theorem its really neat.

  • @0peter897
    @0peter897 Год назад

    Nice explanation, thank you! One note: Vizing's theorem can only be used to simple graphs. (I failed my midterm, because I forgot about this :c )

  • @quezcatol
    @quezcatol 3 года назад

    was waiting for this, thanks!

    • @WrathofMath
      @WrathofMath  3 года назад

      My pleasure! Thanks for watching!

  • @vonage_sasb9356
    @vonage_sasb9356 6 месяцев назад

    Hello,
    Do any one know answer for "Does there exist a 3-edge colourable graph with 10 vertices and 20 edges ?"

    • @chaotischekreativitat9391
      @chaotischekreativitat9391 6 месяцев назад

      Sounds like an exercise question 😂
      Hint: Think about the degrees of those vertices that are possible under these circumstances.

  • @aashsyed1277
    @aashsyed1277 3 года назад

    Nice explanation! 👍

  • @user-yf5xs2zf5l
    @user-yf5xs2zf5l Месяц назад

    Thank you

  • @aashsyed1277
    @aashsyed1277 3 года назад

    Awesome 😎

  • @ponnu1500
    @ponnu1500 3 года назад

    Very useful video.. Thankyou

  • @neutronology5524
    @neutronology5524 3 года назад +1

    nice im using it in class rn

    • @WrathofMath
      @WrathofMath  3 года назад +1

      Thank you for watching, glad it helped!

    • @PunmasterSTP
      @PunmasterSTP 3 месяца назад

      That's cool. How'd the rest of your class go?

  • @janmarjagolina1235
    @janmarjagolina1235 2 года назад

    Is empty graph has 0 chromatic index?

  • @dhe1782
    @dhe1782 Год назад

    How to proof that the crossing number of K6 is 3. Thanks!!

  • @PunmasterSTP
    @PunmasterSTP 3 месяца назад +1

    Oh man, another edgy lecture...

  • @vonage_sasb9356
    @vonage_sasb9356 6 месяцев назад

    Hello,
    Do any one know answer for "Does there exist a 3-edge colourable graph with 10 vertices and 20 edges ?"

    • @umarmurtala5572
      @umarmurtala5572 6 месяцев назад

      From my little understanding, I don't think it exists, since an graph graph can't be 3 edge colorable

    • @vonage_sasb9356
      @vonage_sasb9356 5 месяцев назад +1

      @@umarmurtala5572 Yes you are correct