Playing Sudoku on Random 3-Regular Graphs

In this 14-minute conference talk from the International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2025), Austin Eide from Toronto Metropolitan University explores the mathematical challenge of playing Sudoku on random 3-regular graphs. Discover how traditional Sudoku concepts are applied to graph theory, examining the probabilistic and combinatorial aspects of this novel approach. The presentation, scheduled for May 6, 2025 at the Fields Institute, offers insights into asymptotic methods for analyzing algorithms in this unique context.