0.25
0.5
0.75
1.25
1.5
1.75
2
Immersions of graphs and digraphs
Published on May 04, 20152218 Views
A graph G contains another graph H as an immersion if there is an injective mapping ι : V (H) → V (G) and for each edge uv ∈ E(H) there is a path Puv in G joining vertices ι(u) and ι(v) such that the
Related categories
Chapter list
Immersions of graphs and digraphs00:00
Immersion and strong immersion00:56
Immersion and strong immersion of K- 502:35
Motivation: Hadwiger and Hajos Conjecture04:53
Well-Quasi-Ordering07:56
Grid Theorem11:34
Two examples13:21
Rough Structure Theorem15:45
Gomory-Hu Tree19:07
Proof of the Structure Theorem21:17
Some further results22:46
Immersions in digraphs32:56
Some more bad news35:15
Graph36:59
Strong connectivity helps40:15
Rough Structure - Eulerian Case44:27
Eulerian digraphs46:46