Edge-connectivity of undirected and directed hypergraphs

Index
(X, Y )-composition, 25
(k, l)-edge-connected digraph, 16
(k, l)-edge-connectivity, 78
(k, l)-partition-connected graph, 15
(k, l)-partition-connectivity, 90
(r, 1)-hyperarc, 19
G-even subset, 100
T -odd orientation, 100
ν-hyperedge, 17
c-composition, 25
k-edge-connected digraph, 13, 20
k-edge-connected graph, 13
k-edge-connected hypergraph, 18
k-partition-connected graph, 15
k-partition-connectivity, 84
k-rooted-connected digraph, 16
k-rooted-connected dir. hypergraph, 21
p-full partition, 53, 55
arborescence, 13
base polyhedron, 33
circuit matroid, 32
circuit matroid of hypergraphs, 87
co-disjoint sets, 27
co-partition, 22
complete splitting, 48
composition, 24
connected hypergraph, 17
connectivity from S to T , 20
contra-polymatroid, 33
137
covering a set function, 12, 18, 21
critical partition, 57
cross-free family, 27
cross-hyperedge, 22
crossing family, 54
crossing sets, 27
crossing supermodular set function, 34
degree of node, 17
degree-specification, 12
directed hypergraph, 19
directed splitting-off, 71
elementary bipartite graph, 86
entering a set, 17, 19
evaluation oracle, 45
family of sets, 22
feasible splitting-off, 57
forest-reducible hypergraph, 85
full truncation, 36
fully submodular, 30
fully supermodular set function, 31
head node, 19
height of a composition, 24
hyperarc, 19
hypercircuit, 86
hyperedge, 16
hyperforest, 86
hypergraph, 16
hypergraphic matroid, 87