Journal of the Operations Research Society of China ›› 2021, Vol. 9 ›› Issue (1): 119-129.doi: 10.1007/s40305-018-0224-4

Previous Articles     Next Articles

Sufficient Conditions for Maximally Edge-Connected Hypergraphs

Lin-Ken Tong1, Er-Fang Shan2   

  1. 1 Department of Mathematics, Shanghai University, Shanghai 200444, China;
    2 School of Management, Shanghai University, Shanghai 200444, China
  • Received:2018-03-19 Revised:2018-08-12 Online:2021-03-11 Published:2021-03-11
  • Contact: Er-Fang Shan, Lin-Ken Tong E-mail:efshan@shu.edu.cn;tonglinken92@163.com
  • Supported by:
    This research was partially supported by the National Natural Science Foundation of China (Nos. 11571222 and 11871329).

Abstract: 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.

Key words: Hypergraph, Edge-connectivity, Maximally edge-connected

CLC Number: