filmov
tv
Graph Theory 8-2: More on Connectivity and Minors

Показать описание
In this second video of Week 8, we explore more results on connectivity and minors. In particular, we study how high average degree leads to a subgraph of high connectivity (Mader's Theorem), and how graphs of linear connectivity are k-linked (Bollabas-Thomason).