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 four regular 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.
|Graph theory, algorithms and complexity|
|Discrete mathematics, graph theory, theoretical computing science|
|Brewster, Richardemail@example.com||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.|
|Oellermann, Ortrudfirstname.lastname@example.org||Graph theory with emphasis on distance notions in graphs including graph convexity, graph connectivity and the path partition conjecture for oriented graphs.|
|van Bommel, Christopheremail@example.com|