Degree sequence conditions for maximally edge-connected and super edge-connected hypergraphs

DOI10.1007/s00373-020-02165-wzbMath1442.05033OpenAlexW3015378101MaRDI QIDQ2191264

Yingzhi Tian, Shuang Zhao, Ji Xiang Meng

Publication date: 24 June 2020

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-020-02165-w

zbMATH Keywords

hypergraphedge-connectivitydegree sequencemaximally edge-connected hypergraphsuper edge-connected hypergraph

Mathematics Subject Classification ID

Hypergraphs (05C65) Connectivity (05C40) Vertex degrees (05C07)

Related Items (1)

Connectivity of Cartesian product of hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Realizing degree sequences with \(k\)-edge-connected uniform hypergraphs
• Maximally edge-connected hypergraphs
• A meshless Galerkin scheme for the approximate solution of nonlinear logarithmic boundary integral equations utilizing radial basis functions
• Maximally edge-connected and vertex-connected graphs and digraphs: A survey
• On graphs with equal edge connectivity and minimum degree
• On graphs with equal edge-connectivity and minimum degree
• Sufficient conditions for maximally edge-connected hypergraphs
• Maximally connected \(p\)-partite uniform hypergraphs
• Congruent Graphs and the Connectivity of Graphs
• Connectivity in Hypergraphs
• A Graph-Theoretic Approach to a Communications Problem
• Asymptotic Formulas for the Probability of k-Connectedness of Random Graphs

This page was built for publication: Degree sequence conditions for maximally edge-connected and super edge-connected hypergraphs