The edge splittings and connectivity augmentation theorems in directed hypergraphs (dypergraphs) were proved. A dypergraph comprised of a finite collection of hyperedges and hypervertices. The theorem proving process involved extension of the results obtained by Mader and Frank on directed graphs. The equalities in the lemmas were proved by counting the contribution of an edge to the sides.
- Connectivity augmentation
- Directed graphs and hypergraphs
- Edge splitting
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics