Discrete Mathematics

Our Research

We are one of the largest and oldest discrete math groups in Canada. Our group has a wide variety of expertise in pure and applied discrete math and combinatorics. Our research themes include Structural Graph Theory, matroids, enumeration, bioinformatics, ancestral genomics, digital communications, and Coding Theory.


Join us for our weekly Discrete Math Seminar every Tuesday from 1:30 - 2:30 in SC K9509

News:  We will be hosting 2 events in 2019 - CanaDAM 2019 and Fq14
Click on the event names for more info!




Cedric Chauve

Computational Genomics and Paleogenomics

Caroline Colijn

Canada 150 Research Chair.  "Modern" or maybe "statistical" applied math; applying discrete math and combinatorics, as well as stochastic processes, probability and biomathematics.

Matt Devos

Graph Theory

Luis Goddyn

Graph Theory

Jonathan Jedwab

Sequence and Array Correlations, Digital Communications, Quantum Information Theory

Petr Lisonek

Cryptography, Coding theory, Quantum information theory

Marni Mishna

Analytic and Enumerative Combinatorics

Bojan Mohar

Graph Theory

Tamon Stephen

Combinatorial Optimization


Tom Brown

Ramsey Theory
(Emeritus Faculty)


Jan Manuch

Computational Biology and Bioinformatics
(Computer Science, UBC)


Lily Yen

Combinatorial Enumeration
(Adjunct Faculty, Math / Math & Stats, Capilano University)


Postdoctoral Fellows & Visitors


PhD Students

  • Reza Dastbasteh
  • Sebastian Gonzalez
  • Kevin Halasz
  • Masood Masjoody
  • Abhinav Shantanam
  • Samuel Simon
  • Nathan Singer
  • Amelie Trotignon

If you are a current SFU Mathematics Postdoctoral Fellow or Graduate Student in the Discrete Mathematics Research Group,
and your name is missing from the above lists, please send an email to Casey Bell.


Recent Theses


Degree Student Name Thesis Title Supervisor
PhD Seyyed Hosseini Game of Cops and Robbers on Eulerian DigraphsB Bojan Mohar


Degree Student Name Thesis Title Supervisor
PhD Ross Churchley Odd Disjoint Trails and Totally Odd Graph Immersions Bojan Mohar
MSc Benjamin Moore Rooted Graph Minors and Reducibility of Graph Polynomials Karen Yeats
PhD Iain Crump Graph Invariants with Connections to the Feynman Period in φ4 Theory Karen Yeats
MSc Olga Zasenko Algorithms for Colourful Simplicial Depth and Median in the Plane Tamon Stephen
MSc Tara Petrie The Combinatorial RNA Design Problem for Binary Trees Jonathan Jedwab
MSc Stefan Trandafir Magic Eulerian Hypergraphs Petr Lisonek
MSc Kevin Halasz Coloring Cayley Tables of Finite Groups Luis Goddyn
MSc Samuel Simon Linking Systems of Difference Sets Jonathan Jedwab
MSc Adam Dyck The Realisability of γ-graphs Jonathan Jedwab
MSc (Project) France Paquet-Nadeau On the Maximum Size of Condensed Sequences Neighbourhoods under the Levenshtein distance Cedric Chauve


Degree Student Name Thesis Title Supervisor
PhD Justin Chan Three Problems Involving Permutations  Jonathan Jedwab
MSc Akbar Rafiey Algorithmic Aspects of some Vertex Ordering Problems   Ladislav Stacho
MSc Lucien Lapierre Vectorial Bent Functions in Characteristic Two Petr Lisonek

2015 and Older - Click HERE