The Lovász–Cherkassky theorem in infinite graphs

Link:

https://doi.org/10.1112/tlm3.70001

Autor/in:

Joó, A.

Erscheinungsjahr:

2024

Medientyp:

Text

Beschreibung:

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 (Formula presented.) -paths in an ‘inner Eulerian’ setting obtained by Lovász and Cherkassky independently in the '70s. © 2024 The Author(s). Transactions of the London Mathematical Society is copyright © London Mathematical Society.

Lizenz:

info:eu-repo/semantics/openAccess

Quellsystem:

Forschungsinformationssystem der UHH

Interne Metadaten

Quelldatensatz: oai:www.edit.fis.uni-hamburg.de:publications/d8dd66ed-8fe1-420e-9a20-77ce27121512