We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
The edge‐connectivity of vertex‐transitive hypergraphs.
- Authors
Burgess, Andrea C.; Luther, Robert D.; Pike, David A.
- 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.
- Subjects
HYPERGRAPHS; AUTOMORPHISM groups; GRAPH connectivity; GENERALIZATION
- Publication
Journal of Graph Theory, 2024, Vol 105, Issue 2, p252
- ISSN
0364-9024
- Publication type
Article
- DOI
10.1002/jgt.23035