Sufficient Conditions for Maximally Edge-Connected Hypergraphs  

作　　者：Lin-Ken Tong Er-Fang Shan 

机构地区：[1]Department of Mathematics,Shanghai University,Shanghai 200444,China [2]School of Management,Shanghai University,Shanghai 200444,China

出　　处：《Journal of the Operations Research Society of China》2021年第1期119-129,共11页中国运筹学会会刊（英文）

基　　金：This research was partially supported by the National Natural Science Foundation of China(Nos.11571222 and 11871329).

摘　　要：The edge-connectivity of a graph or a hypergraph is defined as the minimum number of edges whose removal renders the graph or hypergraph disconnected.A graph or hypergraph is called maximally edge-connected if the edge-connectivity equals its minimum degree.In this paper,we show that some classical sufficient conditions for graphs to be maximally edge-connected can be generalized to hypergraphs.

关 键 词：Hypergraph EDGE-CONNECTIVITY Maximally edge-connected 

分 类 号：O157.5[理学—数学]