Paper Info
Title
Degree Sequence Conditions for Maximally Edge-Connected and Super Edge-Connected Hypergraphs
Abstract
Let H be a connected hypergraph with minimum degree $$\delta$$ and edge-connectivity $$\lambda$$. The hypergraph H is maximally edge-connected if $$\lambda = \delta$$, and it is super edge-connected or super-$$\lambda$$, 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-$$\lambda$$ graphs. In this paper, we generalize these and some other degree sequence conditions to uniform hypergraphs.
Year
DOI
Venue
2020
10.1007/s00373-020-02165-w
Graphs and Combinatorics
Keywords
DocType
Volume
Degree sequence, Edge-connectivity, Hypergraph, Maximally edge-connected, Super edge-connected
Journal
36
Issue
ISSN
Citations 
4
0911-0119
0
PageRank 
References 
Authors
0.34
0
3
Name
Order
Citations
PageRank
Shuang Zhao100.34
Yingzhi Tian2209.28
Jixiang Meng335355.62