The edge-connectivity of a connected hypergraph H is the minimum number of edges (named as edge-cut) whose removal makes H disconnected. It is known that the edge-connectivity of a hypergraph is bounded above by its minimum degree. H is super edge-connected, if every edge-cut consists of edges incident with a vertex of minimum degree. A hypergraph H is linear if any two edges of H share at most one vertex. We call H uniform if all edges of H have the same cardinality. Sufficient conditions for equality of edge-connectivity and minimum degree of graphs and super edge-connected graphs are known. In this paper, we present a generalization of some of these sufficient conditions to linear and/or uniform hypergraphs.

连接超图H的边连通性是其移除使H断开连接的最小边数（称为边切割）。众所周知，超图的边连通性在其最小度以上。H是超边连接的，如果每个边切割都由与最小度数顶点相交的边组成。甲超图ħ是线性的，如果任何两个边缘ħ至多一个顶点的份额。我们称^ h均匀，如果所有边缘^ h具有相同的基数。图和超边连通图的边连通性和最小度相等的充分条件是已知的。在本文中，我们将这些充分条件中的一些推广到线性和/或均匀超图。