top of page

Aidan Dunkelberg
Combinatorist working on perfect matchings of graphs, especially enumeration problems for the less-studied non-bipartite and nonplanar cases. Passionate about human-first teaching and collaborative learning in the digital age.
Department of Mathematics, Indiana University Bloomington


bottom of page