University of Victoria

Strong cocomparability graphs are the reflexive graphs whose adjacency matrix can be rearranged by a simultaneous row and column permutation to avoid the submatrix with rows 01, 10. Strong cocomparability graphs form a subclass of cocomparability...

The boxicity of a graph G is a key graph parameter introduced by Roberts in 1969. It represents the minimum dimension d such that G can be realized as the intersection graph of a family of axis-parallel boxes in R^d. Boxicity is an important measure...

Counting lattice paths with unit up and right steps beginning at the origin that are somehow constrained by a boundary is an old problem. When the boundary is the line y=x the celebrated Chung-Feller theorem states the number of paths having k flaws...

We analyse the metastable behaviour of the disordered Curie-Weiss-Potts (DCWP) model subject to a Glauber dynamics. The model is a randomly disordered version of the mean-field q-spin Potts model (CWP), where the interaction coefficients between...

The directed landscape is a random directed metric on the plane that arises as a scaling limit of a classical metric models in the KPZ universality class. In this talk, we will discuss a functional large deviation principle (LDP) for the entire...

A spanning tree of a finite connected graph G is a connected subgraph of G that includes every vertex and contains no cycles. In this talk we will consider uniformly drawn spanning trees of high-dimensional graphs, and explain why, under appropriate...

A proper conflict-free colouring of a graph is a (vertex-)colouring with no monochromatic edges such that for every nonisolated vertex v, the neighbourhood N(v) contains a vertex w coloured with a colour not appearing on N(v)-{w}. For a real number h...

For fixed n, consider the symmetric group S_n on the symbols 1,...,n and the set of *star* transpositions, the transpositions that contain the symbol n. A *star factorization* of a permutation b in S_n of length k is the writing of b as the product...

In recognition of Rod Edwards’ remarkable contributions to the field of Mathematical Modeling, we are inviting Rod’s current and former students, postdocs, close collaborators, friends and colleagues to attend this event, scheduled to take place on...

The theory of combinatorial limits, which provides analytic tools to represent and study large discrete structures, resulted in new views on a wide range of topics in mathematics and computer science and also opened new connections between...