Alice Lacaze-Masmonteil | PIMS - Pacific Institute for the Mathematical Sciences

PIMS-CNRS Postdoctoral Fellow, University of Regina

Alice Lacaze-Masmonteil is a PIMS-CNRS postdoctoral fellow at the University of Regina under the sponsorship of Karen Meagher. She is also completing her Ph.D. at the University of Ottawa under the supervision of Mateja Šajna. During her doctoral studies, she had the opportunity to conduct a seven-month research visit at Monash University in Melbourne, Australia. Her research interests are in graph theory and cycle decomposition problems. Namely, she is interested in investigating cycle decomposition problems on directed graphs.

Originally from Paris, France, she moved to Canada in 2003 and has lived in Alberta, Ontario, and Nova Scotia. In her spare time, she enjoys trekking, bouldering, and playing soccer.

Defined as the difference between its two largest eigenvalues, the spectral gap of a graph plays an important role on our understanding of its connectivity as observed by Godsil and Royle (2001). Since computing the largest eigenvalue of a graph is...

The game of Cops and Robber played on graphs is a turn-based game between a set of $k \geqslant 1$ cops and a single robber. Cops and robber alike sit on the vertices of the graph with the cops first selecting their starting vertices. At the...

A directed variant of the famous Oberwolfach problem, the directed Oberwolfach problem considers the following scenario. Given n people seated at t round tables of size m1,m2…,mt, respectively, such that m1+m2+⋯+mt=n, does there exist a set of n−1...

In this talk, I will discuss recent progress on the directed Oberwolfach problem. A directed variant of the famous Oberwolfach problem, the directed Oberwolfach problem considers the fol- lowing scenario. Given m people and t round tables of size m1...