Discrete mathematics
Our discrete mathematics group researches graph theory, algorithms, combinatorial designs, error-correcting codes, and extremal set theory.
We are lucky to enjoy a very visual subject, where geometric structures and coloured labellings often appear. In addition, discrete math has applications to theoretical computer science, electrical engineering, statistics, and biology, not to mention relationships with the rest of mathematics.
The six regular research faculty members in our group are joined by a strong group of graduate students, visitors, postdoctoral fellows, adjunct professors, and colleagues from computer science. We hold a weekly seminar and have hosted a range of events, from small workshops to large international conferences.
All in all, UVic is among the top schools in the world for studying discrete mathematics.
Faculty
| Name | Contact | Research interests |
| Butterfield, Jane | Office:
NA | Graph theory and mathematics education. |
| Dukes, Peter | Office:
DTB-A525 | Combinatorics. |
| Huang, Jing | Office:
DTB-A549 | Graph theory, algorithms and complexity. |
| MacGillivray, Gary | Office:
DTB-A442 | Discrete mathematics, graph theory, theoretical computing science. |
| Morrison, Natasha | Extremal graph theory, random graphs and processes, graph colouring, bootstrap percolation and related cellular automata, and Ramsey theory | |
| Mynhardt, Kieka | Office:
DTB-A541 | Graph theory. |
| Noel, Jonathan | Office:
DTB-A435 | Extremal combinatorics, probablistic combinatorics, combinatorial limits, boostrap percolation, graph colourings, computational complexity |
| Simmons, Jill | Office:
DTB-A537 | Mathematics education, discrete math |
Adjuncts
| Name | Contact | Research interests |
| Brewster, Richard | Office:
NA | Discrete mathematics; theoretical computer science; computational complexity; graph theory; polynomial time algorithms and good characterizations; graph homomorphisms and colouring problems; domination problems; graph packings and matchings; local search heuristics and discrete optimization. |
| Huggan, Melissa | Office:
NA | combinatorial game theory, graph theory, and pursuit-evasion games |
| Oellermann, Ortrud | Office:
NA | Graph theory with emphasis on distance notions in graphs including graph convexity, graph connectivity and the path partition conjecture for oriented graphs. |
| Reed, Bruce | Office:
NA | Graph Theory |
Postdoctoral fellows
| Name | Contact | Supervisor |
| Behague, Natalie | Office:
DTB-A518 | Morrison, Noel |
| Hyde, Joseph | Office:
DTB-A453 | Morrison, Noel, Reed |
PhD students
| Name | Contact | Supervisor |
| Gaede, Tao | Office:
NA | Dukes |
| Lee, Jae-baek | Office:
DTB-A534 | MacGillivray, Noel |
| Lin, Mengru | Office:
DTB-A555 | MacGillivray |
| Slobodin, Aaron | Office:
DTB-A455 | MacGillivray, Myrvold |
| Virgile, Virgelot | Office:
DTB-A534 | MacGillivray, Mynhardt |
| Ye, Ying Ying (Fay) | Office:
DTB-A534 | Huang |
Master's students
| Name | Contact | Supervisor |
| Kuperus, Akina | Office:
NA | Morrison |
| Mullin, Frederick (Freddie) | Office:
NA | MacGillivray |
| Nimegeers, Kate | Office:
NA | Dukes |
| Ogden, Shannon | Office:
NA | Mynhardt, Morrison |
| Williams, Ethan | Office:
DTB-A202 | MacGillivray |
| Wright, Ashna | Office:
NA | Morrison, Noel |