A counterexample to a conjecture of Edmonds and Giles
From MaRDI portal
Publication:1145156
DOI10.1016/0012-365X(80)90057-6zbMath0445.05047WikidataQ122955205 ScholiaQ122955205MaRDI QIDQ1145156
Publication date: 1980
Published in: Discrete Mathematics (Search for Journal in Brave)
Integer programming (90C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)
Related Items (12)
The positive circuits of oriented matroids with the packing property or idealness ⋮ Disjoint dijoins ⋮ Disjoint dijoins for classes of dicuts in finite and infinite digraphs ⋮ Intersecting restrictions in clutters ⋮ On Packing Dijoins in Digraphs and Weighted Digraphs ⋮ Fractional packing in ideal clutters ⋮ Cuboids, a class of clutters ⋮ Note on a min-max conjecture of Woodall ⋮ A new infinite class of ideal minimally non-packing clutters ⋮ Ideal Clutters That Do Not Pack ⋮ Packing and covering of crossing families of cuts ⋮ A family of perfect graphs associated with directed graphs
Cites Work
This page was built for publication: A counterexample to a conjecture of Edmonds and Giles
