Document Type
Lecture
Publication Date
3-27-2003
Abstract
We consider simple graphs with a dense edge set. Last time, we showed the ideas how we can find some minor structures in such graphs. In this talk, the outlines to prove that such graphs are 3-linked will be given and related problems will also be proposed.
Relational Format
presentation
Recommended Citation
Wei, Bing, "Graph Minors and Linkages III" (2003). Combinatorics Seminar. 114.
https://egrove.olemiss.edu/math_combinatorics/114
COinS