Title: Cayley incidence graphs
| Speaker: | Joannes Vermant |
| Affiliation: | Umeå University |
| Location: | Please contact Sabrina Lato for Zoom link. |
Abstract: Evra, Feigon, Maurischat, and Parzanchevksi defined Cayley incidence graphs (which they refer to as Cayley bigraphs), a class of biregular graphs used to construct bipartite expander graphs. These graphs are defined using a group G and a set of cells satisfying certain properties. Alternatively, they can be described as the incidence graphs of uniform and regular linear hypergraphs with a group G acting regularly on the vertices. In this talk, I will explore some basic properties of Cayley incidence graphs, as well as their connections to other combinatorial objects such as designs, coset geometries, and difference sets.
This talk is based on joint work with Arnbjörg Soffía Árnadóttir, Alexey Gordeev, Sabrina Lato, and Tovohery Randrianarisoa.