Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs

DOI10.1016/S0166-218X(02)00582-6zbMath1022.05052OpenAlexW1969440012MaRDI QIDQ1410701

Jörgen Bang-Jensen, Steéphan Thomassé

Publication date: 14 October 2003

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(02)00582-6

zbMATH Keywords

Edmonds' theorem on arc-disjoint branchings

Mathematics Subject Classification ID

Hypergraphs (05C65)

Related Items

Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings

Cites Work

• Submodular functions in graph theory
• On the Problem of Decomposing a Graph into n Connected Factors
• Digraphs
• Minimum partition of a matroid into independent subsets
• Unnamed Item