Edge splitting and connectivity augmentation in directed hypergraphs

Alex R. Berg, Bill Jackson, Tibor Jordán

Research output: Contribution to journalArticle

4 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)71-84
Number of pages14
JournalDiscrete Mathematics
Issue number1-3
Publication statusPublished - Dec 11 2003


  • Connectivity augmentation
  • Directed graphs and hypergraphs
  • Edge splitting
  • Edge-connectivity

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Fingerprint Dive into the research topics of 'Edge splitting and connectivity augmentation in directed hypergraphs'. Together they form a unique fingerprint.

  • Cite this