Let H = (V, E) be a hypergraph, where V is set of vertices and E non-empty subsets called edges. If all edges have the same cardinality r, then an r-uniform hypergraph; if consists r-subsets V, complete denoted by $$K_n^r$$ , n |V|. A hypergraph H′ (V′, E′) subhypergraph V′ ⊆ E′ E. The edge-connectivity minimum edge F such that − not connected, F). An k-edge-maximal every has at most k, but for...