The Lov\'asz-Cherkassky theorem in infinite graphs
Combinatorics
2023-11-14 v1
Abstract
Infinite generalizations of theorems in finite combinatorics were initiated by Erd\H{o}s due to his famous Erd\H{o}s-Menger conjecture (now known as the Aharoni-Berger theorem) that extends Menger's theorem to infinite graphs in a structural way. We prove a generalization of this manner of the classical result about packing edge-disjoint -paths in an ``inner Eulerian'' setting obtained by Lov\'asz and Cherkassky independently in the '70s.
Keywords
Cite
@article{arxiv.2311.06611,
title = {The Lov\'asz-Cherkassky theorem in infinite graphs},
author = {Attila Joó},
journal= {arXiv preprint arXiv:2311.06611},
year = {2023}
}