Year: 2024
Type: article
Abstract: Infinite generalizations of theorems in finite combinatorics were initiated by Erdős due to his famous Erdő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ász and Cherkassky independently in the '70s.
DOI: 10.1112/tlm3.70001
Author: Attila Joó
Institution: Universität Hamburg
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: gold
Estimated APC paid: $1,730
OpenAlex ID: W4404829835