Bi-coset graphs, which were originally dened by Du and Xu in 2000, completely characterize all semi-transitive graphs and can be viewed as generalizations of Haar (di-)graphs (sometimes called bi-Cayley (di-)graphs). In this talk, we will nd strong constraints on the automorphism groups of bi-coset graphs and digraphs.

Come and explore the infinite possibilities of mathematics with us!