Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs (Q1410701)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs
scientific article

    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
    0 references
    0 references

    Identifiers