Disjoint dijoins for classes of dicuts in finite and infinite digraphs
From MaRDI portal
Publication:5051459
DOI10.5070/C62359180zbMath1498.05114arXiv2109.03518MaRDI QIDQ5051459
J. Pascal Gollin, Konstantinos S. Stavropoulos, Karl Heuer
Publication date: 23 November 2022
Published in: Combinatorial Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2109.03518
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20) Infinite graphs (05C63)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Disjoint dijoins
- Menger's theorem for infinite graphs
- Directed cut transversal packing for source-sink connected graphs
- A counterexample to a conjecture of Edmonds and Giles
- Elementary submodels in infinite combinatorics
- A note on disjoint dijoins
- Decompositions of infinite graphs. I: Bond-faithful decompositions
- Combinatorial Optimization
- Note on a min-max conjecture of Woodall
- Graph Theory
- Packing Dicycle Covers in Planar Graphs with No K 5–e Minor
- Min-max Relations for Directed Graphs
- A Minimax Theorem for Directed Graphs
- Set Theory
- Digraphs
- A Theorem on Graphs, with an Application to a Problem of Traffic Control
- On dijoins
- On the infinite Lucchesi–Younger conjecture I
This page was built for publication: Disjoint dijoins for classes of dicuts in finite and infinite digraphs
