Half-integral Erdos-P\'osa property for non-null S-T paths
Abstract
For a group , a -labelled graph is an undirected graph G where every orientation of an edge is assigned an element of so that opposite orientations of the same edge are assigned inverse elements. A path in G is non-null if the product of the labels along the path is not the neutral element of . We prove that for every finite group , non-null S-T paths in -labelled graphs exhibit the half-integral Erdos-P\'osa property. More precisely, there is a function f, depending on , such that for every -labelled graph G, subsets of vertices S and T, and integer k, one of the following objects exists: a family F consisting of k non-null S-T paths in G such that every vertex of G participates in at most two paths of F; or a set X consisting of at most f(k) vertices that meets every non-null S-T path in G. This in particular proves that in undirected graphs S-T paths of odd length have the half-integral Erdos-P\'osa property.
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.