The edge‐connectivity of vertex‐transitive hypergraphs
From MaRDI portal
Publication:6143385
DOI10.1002/JGT.23035arXiv2207.07536MaRDI QIDQ6143385FDOQ6143385
Authors: Andrea Burgess, Robert D. Luther, David A. Pike 
Publication date: 24 January 2024
Published in: Journal of Graph Theory (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/2207.07536
Recommendations
Cites Work
- Title not available (Why is that?)
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- Minimale \(n\)-fach kantenzusammenhängende Graphen
- Edge-connectivity of permutation hypergraphs
- Maximally edge-connected hypergraphs
- Connectivity in hypergraphs
- Connection and separation in hypergraphs
- Sufficient conditions for hypergraphs to be maximally edge-connected
- Sufficient conditions for maximally edge-connected hypergraphs
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)
