Full immersions in Eulerian group-labeled graphs

arXiv:2610.40132 · math.CO · Submitted 2026-10-29 · Read on arXiv

math.CO

Submitted: 2026-10-29

Updated: 2026-10-29

License: http://creativecommons.org/licenses/by/4.0/

The gist: An immersion of a graph H in a graph G is full if the immersion uses every edge of G.

Abstract

An immersion of a graph H in a graph G is full if the immersion uses every edge of G. We give a structure theorem for group-labeled Eulerian graphs excluding a fixed group-labeled graph as a full immersion.

Related papers