Skip to content

Why almost all k-colorable graphs are easy

About this video

Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by video

Analyzes why most k-colorable graphs have tractable solutions. A lecture on graph theory, computational complexity, and phase transitions.

Video by Microsoft Research, played through YouTube's embedded player.