Irreducible Non-Metrizable Path Systems in Graphs

Daniel Cizma, Nati Linial

A path system $\mathcal{P}$ in a graph $G=(V,E)$ is said to be irreducible if there does not exist a partition $V=A\bigsqcup B$ such that $\mathcal{P}$ restricts to a path system on…