Clique Immersion in Digraphs
Author(s)
McDonald, Jessica
Advisor(s)
Editor(s)
Collections
Supplementary to:
Permanent Link
Abstract
Immersion is a containment relation between graphs (or digraphs) which is defined similarly to the more familiar notion of minors, but is incomparable to it. In this talk we focus on immersing a bidirected clique \vec{K}_t in an Eulerian digraph. We show that every Eulerian digraph with minimum degree at least t(t-1) immerses \vec{K_t}, and for t = 4 this requirement can be lowered to t-1. We also provide a rough structure theorem for \vec{K}_t-immersion in Eulerian digraphs. Joint work with Matt DeVos, Bojan Mohar and Diego Scheide.
Sponsor
NSF, NSA, ONR, IMA, Colleges of Sciences, Computing and Engineering
Date
2012-05
Extent
Resource Type
Text
Resource Subtype
Proceedings