Ramsey's theorem for 2 colors

9 months ago

15

Science mathematics Ramsey Ramsey theory graph theory graph coloring clique Ramsey's theorem complete graph edge coloring

Episode 34.

Ramsey's theorem for 2 colors. For any natural numbers $x$ and $y$, in any sufficiently large complete graph whose edges are colored in 2 colors, there exists either a clique of size $x$ of color 1 or a clique of size $y$ of color 2.

The same video on YouTube:
https://youtu.be/EuPiiKhzcDs

The same video on Telegram:
https://t.me/mathematical_bunker/58

Loading comments...

Comments