The edge‐connectivity of vertex‐transitive hypergraphs
From MaRDI portal
Publication:6143385
Abstract: A graph or hypergraph is said to be vertex-transitive if its automorphism group acts transitively upon its vertices. A classic theorem of Mader asserts that every connected vertex-transitive graph is maximally edge-connected. We generalise this result to hypergraphs and show that every connected linear uniform vertex-transitive hypergraph is maximally edge-connected. We also show that if we relax either the linear or uniform conditions in this generalisation, then we can construct examples of vertex-transitive hypergraphs which are not maximally edge-connected.
Recommendations
Cites work
- Connection and separation in hypergraphs
- Connectivity in hypergraphs
- Edge-connectivity of permutation hypergraphs
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- Maximally edge-connected hypergraphs
- Minimale \(n\)-fach kantenzusammenhängende Graphen
- Sufficient conditions for hypergraphs to be maximally edge-connected
- Sufficient conditions for maximally edge-connected hypergraphs
Cited in
(2)
This page was built for publication: The edge‐connectivity of vertex‐transitive hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6143385)
