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 edg...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.展开更多
基金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.
