Date: Friday, September 12, 2025
Speaker: Alexia Yavicoli (University of British Columbia)
Title: On the Erdos similarity problem
Abstract: I will introduce the Erdős similarity problem, providing background and an overview of known partial results. I will then discuss a recent joint work with P. Shmerkin, in which we show that Cantor sets with positive logarithmic dimension satisfy the conjecture. 




Date: Friday, September 18, 2025
Speaker: Vishal Gupta
Title: Minimum spectral radius in a given class of graphs
Abstract: In 1986, Brualdi and Solheid posed the question of determining the maximum and minimum spectral radius of a graph within a given class of simple graphs. Since then, this problem has been extensively studied for various graph classes. In this talk, I will discuss two such classes: simple connected graphs with a given order and size, and simple connected graphs with a given order and dissociation number. This presentation is based on joint work with Sebastian Cioaba, Dheer Noal Desai, and Celso Marques.