Edge splitting and connectivity augmentation in directed hypergraphs

  • Berg A
  • Jackson B
  • Jordán T
Citations of this article
Mendeley users who have this article in their library.


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.




Berg, A. R., Jackson, B., & Jordán, T. (2003). Edge splitting and connectivity augmentation in directed hypergraphs. Discrete Mathematics, 273(1–3), 71–84. https://doi.org/10.1016/s0012-365x(03)00229-2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free