Recommendations
- Sufficient conditions for maximally edge-connected hypergraphs
- Edge-connectivity in hypergraphs
- Sufficient conditions for hypergraphs to be maximally edge-connected and super-edge-connected
- Degree sequence conditions for maximally edge-connected and super edge-connected hypergraphs
- The connectivity of hypergraphs
Cites work
- scientific article; zbMATH DE number 3497930 (Why is no real title available?)
- scientific article; zbMATH DE number 524129 (Why is no real title available?)
- scientific article; zbMATH DE number 863476 (Why is no real title available?)
- A Graph-Theoretic Approach to a Communications Problem
- Augmenting hypergraphs by edges of size two
- Edge-augmentation of hypergraphs
- HYPERGRAPHS
- Inverse degree and edge-connectivity
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
Cited in
(22)- The restricted edge-connectivity and \(\lambda^\prime\)-optimality of hypergraphs
- Super Edge-Connected Linear Hypergraphs
- scientific article; zbMATH DE number 4008443 (Why is no real title available?)
- Edge-connectivity in hypergraphs
- scientific article; zbMATH DE number 3857159 (Why is no real title available?)
- The edge‐connectivity of vertex‐transitive hypergraphs
- On the sizes of \(k\)-edge-maximal \(r\)-uniform hypergraphs
- Sufficient conditions for hypergraphs to be maximally edge-connected
- Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs
- Connection and separation in hypergraphs
- Connectivity in hypergraphs
- Edge-connectivity of permutation hypergraphs
- Hyperconnectivity of graphs
- Sufficient conditions for maximally edge-connected hypergraphs
- Connectivity of Cartesian product of hypergraphs
- scientific article; zbMATH DE number 5942207 (Why is no real title available?)
- Two sufficient conditions for maximally restricted-edge-connected hypergraphs
- An edge extremal result for subcohesion
- The connectivity of hypergraphs
- Degree sequence conditions for maximally edge-connected and super edge-connected hypergraphs
- Maximally connected \(p\)-partite uniform hypergraphs
- A recursive formula for the reliability of a \(r\)-uniform complete hypergraph and its applications
This page was built for publication: Maximally edge-connected hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q501024)
