The Lovász-Cherkassky theorem in infinite graphs
From MaRDI portal
Publication:6658774
DOI10.1112/TLM3.70001MaRDI QIDQ6658774
Publication date: 8 January 2025
Published in: Transactions of the London Mathematical Society (Search for Journal in Brave)
Paths and cycles (05C38) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45) Infinite graphs (05C63)
Cites Work
- Title not available (Why is that?)
- The Max-Flow Min-Cut theorem for countable networks
- LP duality in infinite hypergraphs
- Infinite gammoids: minors and duality
- Menger's theorem for infinite graphs
- Matchings in infinite graphs
- Infinite matching theory
- Über die Maximalzahl kantendisjunkter A-Wege
- Injective choice functions for countable families
- Über die Maximalzahl kreuzungsfreier H-Wege
- Topological infinite gammoids, and a new Menger-type theorem for infinite graphs
- On the intersection of infinite matroids
- Strongly perfect infinite graphs
- On the intersection conjecture for infinite trees of matroids
- Proof of Nash-Williams' intersection conjecture for countable matroids
- Strongly maximal antichains in posets
- Elementary submodels in infinite combinatorics
- A decomposition theorem for partially ordered sets
- The Lovász-Cherkassky theorem in countable graphs
- Menger's theorem
- Covering directed and odd cuts
- 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
- Matchings in Countable Graphs
- On some connectivity properties of Eulerian graphs
- The Intersection of Two Infinite Matroids
- König's Duality Theorem for Infinite Bipartite Graphs
- Set Theory
- A Blossom Algorithm for Maximum Edge-Disjoint T-Paths
- A Cantor-Bernstein Theorem for Paths in Graphs
- Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen
- Orientations of infinite graphs with prescribed edge-connectivity
- The Nash-Williams orientation theorem for graphs with countably many ends
This page was built for publication: The Lovász-Cherkassky theorem in infinite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6658774)
