The Lovász-Cherkassky theorem in countable graphs

DOI10.1016/j.jctb.2022.11.001zbMath1505.05071arXiv2102.04203OpenAlexW4310437251MaRDI QIDQ2680564

Attila Joó

Publication date: 4 January 2023

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2102.04203

zbMATH Keywords

Lovász-Cherkassky theorempacking pathsT-path

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38) Infinite graphs (05C63) Flows in graphs (05C21)

Related Items (1)

The Lovász-Cherkassky theorem for locally finite graphs with ends

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A generalization of Tutte's 1-factor theorem to countable graphs
• Menger's theorem for infinite graphs
• Matchings in infinite graphs
• Infinite matching theory
• Über die Maximalzahl kantendisjunkter A-Wege
• Über die Maximalzahl kreuzungsfreier H-Wege
• Nash-Williams' cycle-decomposition theorem
• Proof of Nash-Williams' intersection conjecture for countable matroids
• Elementary submodels in infinite combinatorics
• Vertex-flames in countable rooted digraphs preserving an Erdős-Menger separation for each vertex
• \(T\)-joins in infinite graphs
• A linear programming formulation of Mader's edge-disjoint paths problem
• Graph Theory
• Decomposition of Graphs Into Closed and Endless Chains
• Another Form of a Criterion for the Existence of Transversals
• A General Criterion for the Existence of Transversals
• On some connectivity properties of Eulerian graphs
• The Intersection of Two Infinite Matroids
• Note über Kantenschnittverbände in Graphen
• On a Duality Principle in Infinite Bipartite Graphs
• König's Duality Theorem for Infinite Bipartite Graphs
• Faster algorithms for half-integral T -Path packing
• A Blossom Algorithm for Maximum Edge-Disjoint T-Paths
• On Partitioning the Edges of an Infinite Digraph into Directed Cycles
• A Cantor-Bernstein Theorem for Paths in Graphs
• Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen
• Integer Programming and Combinatorial Optimization

This page was built for publication: The Lovász-Cherkassky theorem in countable graphs