On decomposing a hypergraph into k connected sub-hypergraphs

András Frank, Tamás Király, Matthias Kriesell

Research output: Conference article

51 Citations (Scopus)


By applying the matroid partition theorem of J. Edmonds (J. Res. Nat. Bur. Standards Sect. B 69 (1965) 67) to a hypergraphic generalization of graphic matroids, due to Lorea (Cahiers Centre Etudes Rech. Oper. 17 (1975) 289), we obtain a generalization of Tutte's disjoint trees theorem for hypergraphs. As a corollary, we prove for positive integers k and q that every (kq) -edge-connected hypergraph of rank q can be decomposed into k connected sub-hypergraphs, a well-known result for q=2. Another by-product is a connectivity-type sufficient condition for the existence of k edge-disjoint Steiner trees in a bipartite graph.

Original languageEnglish
Pages (from-to)373-383
Number of pages11
JournalDiscrete Applied Mathematics
Issue number2
Publication statusPublished - szept. 12 2003
EventSubmodularity - Atlanta, GA, United States
Duration: aug. 1 2000aug. 1 2000

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'On decomposing a hypergraph into k connected sub-hypergraphs'. Together they form a unique fingerprint.

  • Cite this