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

DOI10.1016/S0166-218X(02)00582-6MaRDI QIDQ1410701zbMATH OpenOpenAlexFDO

Authors Jørgen Bang-Jensen, Sté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)

Recommendations

• Maximally edge-connected hypergraphs
• Sufficient conditions for maximally edge-connected hypergraphs
• scientific article; zbMATH DE number 3933118
• Local spanning trees in graphs and hypergraphs decomposition with respect to edge connectivity
• On decomposing a hypergraph into \(k\) connected sub-hypergraphs

Cites work

• scientific article; zbMATH DE number 863476 (Why is no real title available?)
• Digraphs
• Minimum partition of a matroid into independent subsets
• On the Problem of Decomposing a Graph into n Connected Factors
• Submodular functions in graph theory

Cited in

(1)

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

This page was built for publication: Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1410701)