2026 CMS Summer Meeting
Saint John, June 5 - 8, 2026
Combinatorial Design Theory
Org: Masoomeh Akbari (University of Ottawa), Kianoosh Shokri (University of Ottawa) and Brett Stevens (Carleton University)
Org: Masoomeh Akbari (University of Ottawa), Kianoosh Shokri (University of Ottawa) and Brett Stevens (Carleton University)
- MASOOMEH AKBARI, University of Ottawa
- TIM ALDERSON, University of New Brunswick
- SIMON BLACKBURN, Royal Holloway, University of London
- AMANDA CHAFEE, Carleton University
- JOY COOPER, University of Victoria
- PETER DANZIGER, Toronto Metropolitan University
- SHONDA DUECK, University of Winnipeg
- AARON DWYER, Carleton University
- MARIE ROSE JERADE, University of Ottawa
- SHUXING LI, University of Delaware
- WILLIAM MARTIN, Worcester Polytechnic Institute
- PRANGYA PARIDA, University of Ottawa
- DAVID PIKE, Memorial University of Newfoundland
Edge-connectivity of vertex-transitive hypergraphs [PDF]
- TIM ALDERSON, University of New Brunswick
-
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.
By using combinatorial designs,
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.
This is joint work with Andrea Burgess and Robert Luther.
- SAROBIDY RAZAFIMAHATRATRA, Carleton University
- SHAHRIYAR POURAKBAR SAFFAR, Memorial University
- KIANOOSH SKOKRI, University of Ottawa
- DOUG STINSON, University of Waterloo / Carleton University
- SOPHIE TOMLIN, University of Ottawa
- SHAHRIYAR POURAKBAR SAFFAR, Memorial University