# Jump-systems of $T$-paths

## TL;DR

This paper proves that certain sets of vectors derived from disjoint T-paths in graphs form jump systems, extending the understanding of combinatorial structures and their optimization properties.

## Contribution

It provides an elementary proof that vectors from disjoint T-paths in graphs form jump systems, with implications for combinatorial optimization and related theories.

## Key findings

- Vectors from disjoint T-paths form jump systems
- The result applies to both vertex- and edge-disjoint paths
- Connections to recent jump system intersection theorems

## Abstract

Jump systems are sets of integer vectors satisfying a simple axiom, generalizing matroids, also delta-matroids, and well-kown combinatorial examples such as degree sequences of subgraphs of a graph. It is useful to know if a set of vectors defined from combinatorial structures is a jump system: this has consequences for optimizing on the set, or on some derived sets of vectors. In this note we are mainly concerned in telling our proof of the following more than two decades old fact and its original, elementary proof for an example different from degree sequences: {\em Given an udirected graph $G=(V,E)$ and $T\subseteq V$, the vectors $m$ indexed by $T$ for which there exist a set of openly disjoint $T$-paths so that each $t\in T$ is the endpoint of exactly $m(t)$ paths forms a jump system. The same holds for edge-disjoint $T$-paths.} We are also exhibiting the context and some consequences of this fact, with some pointers to recent developments, among them ro another proof by Iwata and Yokoi, to some related jump system intersection theorems and to some open problems.