An upper bound on the chromatic number of a graph as the maximum degree plus 1
4 months ago
29
Episode 17.
An upper bound on the chromatic number of a graph as the maximum degree plus 1.
Theorem. The chromatic number of a graph is less or equal than the maximum degree plus 1.
The same video on YouTube:
https://youtu.be/y7qz-Y2ede8
The same video of Telegram:
https://t.me/mathematical_bunker/41
Loading comments...
-
1:21:25
Mally_Mouse
5 hours agoLet's Yap About It - LIVE!
14.2K6 -
5:35
Cooking with Gruel
21 hours agoMaking Fresh Salted Caramel
22.6K5 -
16:16
DeVory Darkins
18 hours ago $6.76 earnedMedia Panics after Trump Threatens to Sue Media for Defamation
34.3K90 -
2:15:34
Matt Kohrs
5 hours agoFed Powell Speech & FOMC Rate Decision
23.3K3 -
LIVE
StoneMountain64
4 hours agoThe MOST hyped game of the YEAR
169 watching -
1:50:12
The Quartering
19 hours agoTim Pool SELLS TO DAILY WIRE? Never Eat Hot Dogs Again, Drones & More
85.8K25 -
1:17:48
Tucker Carlson
5 hours agoTom Homan’s Plan to Destroy the Cartel Empire, End Child Trafficking, and Secure the Border for Good
129K160 -
1:06:28
Russell Brand
7 hours agoWho Ordered the Hit on Russia’s General Krylov? - SF516
143K261 -
54:50
The Kevin Trudeau Show
6 hours agoWhat Men Do Wrong In Relationships | Ep. 75
16.5K7 -
12:41
Gun Owners Of America
5 hours agoWe're Fighting Back Against Mexico In Court!
22.9K5