Huy Tuan Pham, Institute for Advanced Study

Abstract

Cayley graphs provide interesting bridges between graph theory, additive combinatorics and group theory. Fixing an ambient finite group, random Cayley graphs are constructed by choosing a generating set at random. These graphs reflect interesting symmetries and properties of the group, at the cost of inducing complex dependencies. I will discuss several insights and stories that we have learned from the analysis of cliques and independent sets in random Cayley graphs. 

See: https://sites.google.com/view/rutgersdmseminar