Totally odd immersions in line graphs
Abstract
The immersion-analogue of Hadwiger's Conjecture states that every graph G contains an immersion of K(G). This conjecture has been recently strengthened in the following way: every graph G contains a totally odd immersion of K(G). We prove this stronger conjecture for line graphs of constant-multiplicity multigraphs, thus extending a result of Guyer and McDonald.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.