Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs (Q1410701)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs |
scientific article; zbMATH DE number 1992947
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs |
scientific article; zbMATH DE number 1992947 |
Statements
Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs (English)
0 references
14 October 2003
0 references
Edmonds' theorem on arc-disjoint branchings
0 references
