The Lov\'asz-Cherkassky theorem in infinite graphs
Abstract
Infinite generalizations of theorems in finite combinatorics were initiated by Erdos due to his famous Erdos-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 T -paths in an ``inner Eulerian'' setting obtained by Lov\'asz and Cherkassky independently in the '70s.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.