Finding hypergraph immersion is fixed-parameter tractable
Finding hypergraph immersion is fixed-parameter tractable
Immersion minor is an important variant of graph minor, defined through an injective mapping from vertices in a smaller graph $H$ to vertices in a larger graph $G$ where adjacent elements of the former are connected in the latter by edge-disjoint paths. Here, we consider the immersion problem in the …