Discrete mathematics

Discrete mathematics at UVic is a lively and growing area, with strengths in graph theory, extremal and probabilistic combinatorics, algorithms and complexity, combinatorial designs, coding theory, graph colourings, random processes, graph homomorphisms, and combinatorial games.

Our subject is both visual and structural: geometric configurations, networks, colourings, patterns, games, and finite algebraic objects all play central roles. At the same time, discrete mathematics connects naturally with theoretical computer science, optimization, statistics, electrical engineering, biology, and many other parts of mathematics.

The core research group consists of six regular faculty members, joined by an active community of graduate students, postdoctoral fellows, visitors, adjunct professors, emeriti, and colleagues in computer science. We run a weekly discrete mathematics seminar, supervise students at all levels, and regularly organize and participate in workshops, summer schools, and international conferences.

Together, these activities make UVic one of Canada’s leading centres for research and training in discrete mathematics.

Faculty

Name Contact Research interests
Butterfield, Jane
Office: DTB-A445
Graph theory and mathematics education.
Dukes, Peter
Office: DTB-A453
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
Noel, Jonathan
Office: DTB-A435
Extremal combinatorics, algorithms, discrete optimization, probablistic combinatorics, combinatorial limits graph colouring, computational complexity, AI-assisted mathematics
top of page

Professors emeritus

Name Contact Research interests
Cockayne, Ernest
Office: NA
 
 
 
Miller, Donald
Office: NA
 
 
 
Mynhardt, Kieka
Office: DTB-A541
 
Graph theory.
top of page

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
Mol, Lucas
Office: NA
Structural graph theory and combinatorics on words.
Myrvold, Wendy
Office: NA
Graph Algorithms, Topological Graph Theory, Combinatorial Algorithms, Network Reliability, Combinatorial Search, Graph Reconstruction, Applications of Graph Theory and Graph Algorithms to Chemistry, Latin Squares
top of page

Postdoctoral fellows

Name Contact Supervisor
Clemen, Felix
Office: DTB-A525
 
Morrison, Noel
top of page

PhD students

Name Contact Supervisor
Gaede, Tao
Office: DTB-A534
 
Dukes
Lin, Mengru
Office: DTB-A527
 
MacGillivray
Ogden, Shannon
Office: DTB-A534
Morrison
top of page

Master's students

Name Contact Supervisor
Cooper, Joy
Office: DTB-A202
 
Dukes, Morrison
Hildebrandt, Marina
Office: DTB-A202
 
Dukes, Huggan
Porter, Amanda
Office: DTB-A202
 
MacGillivray, Huggan
Zhang, Chuan
Office: DTB-A557
 
Huang
top of page