Degree Sequence Conditions for Maximally Edge-Connected and Super Edge-Connected Hypergraphs.

Let H be a connected hypergraph with minimum degree δ and edge-connectivity λ . The hypergraph H is maximally edge-connected if λ = δ , and it is super edge-connected or super- λ , if every minimum edge-cut consists of edges incident with some vertex. There are several degree sequence conditions, for example, Goldsmith and White (Discrete Math 23: 31–36, 1978) and Bollobás (Discrete Math 28:321–323, 1979) etc. for maximally edge-connected graphs and super- λ graphs. In this paper, we generalize these and some other degree sequence conditions to uniform hypergraphs. [ABSTRACT FROM AUTHOR]