Weak Perfect Graph Theorem

แชร์
ฝัง
  • เผยแพร่เมื่อ 20 ต.ค. 2024

ความคิดเห็น • 12

  • @SmellySquid
    @SmellySquid 3 ปีที่แล้ว +7

    I am so glad to have found this gem of a channel

  • @gideontveten1664
    @gideontveten1664 2 ปีที่แล้ว +18

    The animations and proof are beautiful, but they are presented way too fast. Specifically:
    1) You talk too fast.
    2) Other than section breaks, there are no pauses to think.
    3) You don't leave equations and examples on screen long enough.

    • @YTomS
      @YTomS  2 ปีที่แล้ว +8

      I've come to realize this when looking through the videos I've made so far. I will try to slow everything down so it's more digestible, because it seems quite simple to me when I'm making the video (since I have the topic researched), but it is definitely not for anyone else watching.

  • @clementdato6328
    @clementdato6328 3 ปีที่แล้ว +2

    Beautifully done!

  • @Iopia100
    @Iopia100 8 หลายเดือนก่อน

    Lovely stuff 😊

  • @theSpicyHam
    @theSpicyHam ปีที่แล้ว +1

    This stuff feels arcaneish

  • @nitika9769
    @nitika9769 ปีที่แล้ว +1

    i dont get anything :(

  • @tiger7858
    @tiger7858 ปีที่แล้ว +1

    very sleepy bg music

  • @pal181
    @pal181 ปีที่แล้ว

    How each clique containing all of the colors makes set of v-colored vertices a vast independent set?

  • @forthrightgambitia1032
    @forthrightgambitia1032 ปีที่แล้ว

    I'm confused at 7:23. Do you mean G complement doesn't have an independent set with a vertex in each maximum clique? Because by lemma 1 the original G must have one.
    Edit: I watched with the subtitles and they clearly say G complement and you translate between the two... It is a bit confusing.

  • @hacker2ish
    @hacker2ish 3 ปีที่แล้ว

    At 8:42, I don't see why that has tp be true. If you were to color every vertex from a max independent set with the same color then you would have to color every max independent set a different color, but maybe there could exist a better coloring that doesn't assign the same color to the vertices from the same max independent set.

    • @YTomS
      @YTomS  3 ปีที่แล้ว +1

      Let's say that there is some better coloring than the one I described (that uses the independent sets). Since this coloring has less colors, the number of vertices of at least one of its colors will have to be greater than the size of the maximum independent set, which is a contradiction (since it would be a bigger maximum independent set).