Paperlane

no. 5 · Friday 30 October 2026

Full immersions in Eulerian group-labeled graphs

Ioannis Eleftheriadis, Rose McCarty, Caleb McFarland, Evangelos Protopapas and Paul Wollan

math.CO

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.

fields
Combinatorics
pdf ↗ page arXiv:2610.40132 ↗