Two sufficient conditions for maximally restricted-edge-connected hypergraphs

DOI10.15960/J.CNKI.ISSN.1007-6093.2019.02.012zbMATH Open1449.05194MaRDI QIDQ5210348FDOQ5210348

Authors: Jianfeng Pei, Shangwei Lin 

Publication date: 22 January 2020

Recommendations

• The restricted edge-connectivity and \(\lambda^\prime\)-optimality of hypergraphs
• Sufficient conditions for maximally edge-connected hypergraphs
• Sufficient conditions for hypergraphs to be maximally edge-connected and super-edge-connected
• Sufficient conditions for hypergraphs to be maximally edge-connected
• Maximally edge-connected hypergraphs

zbMATH Keywords

minimum degreediameterrestricted edge-connectivityuniform and linear hypergraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07) Connectivity (05C40) Hypergraphs (05C65)

Cited In (2)

• Sufficient conditions for \(k\)-restricted edge connected graphs
• The restricted edge-connectivity and \(\lambda^\prime\)-optimality of hypergraphs

This page was built for publication: Two sufficient conditions for maximally restricted-edge-connected hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5210348)