Sufficient Conditions for Maximally Edge-Connected Hypergraphs

被引：0
|
作者：
Lin-Ken Tong
Er-Fang Shan
机构：
[1] Shanghai University,Department of Mathematics
[2] Shanghai University,School of Management
来源：
Journal of the Operations Research Society of China | 2021年 / 9卷
关键词：
Hypergraph; Edge-connectivity; Maximally edge-connected; 05C65; 05C70;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
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.
引用
收藏
页码：119 / 129
页数：10
相关论文
共 50 条
12345