University of Victoria

Juvan, Malnič and Mohar [J. Combin. Theory Ser. B 68 (1996), 7-22] proved that for every surface S and every integer k, there exists N(S,k) such that any set of simple closed curves on the surface S, where any two are non-homotopic and intersect at...

Back in 1848, in a German chess magazine, Max Bezzel asked how many ways there are to place 8 queens on a chessboard so that no two queens can attack one another. This question caught the attention of many, including Gauss, and was subsequently...

We present the results of a combined experimental and theoretical study of the spreading of viscous droplets over rigid substrates. First, we experimentally investigate the wetting of a roughened glass surface by a viscous droplet of silicone oil...

Stable matching mechanisms are ubiquitous in theory and in practice, with centralized mechanisms used to match students to schools or medical residents to hospitals. It is known that imbalance in the number of agents on either side of a random...

The game of Cops and Robbers is a two-player pursuit–evasion game played on a graph, in which a set of cops attempt to capture a single robber. The players occupy vertices and take turns moving along edges; capture occurs when a cop and the robber...

The question of how species coexist is one of the most fundamental questions in ecology. The standard approach for using models to understand what leads to ecological coexistence can be caricatured as start with a model, specify parameters, and look...

A central tool in additive combinatorics is the polynomial method, a family of powerful techniques for proving results about combinatorial objects by encoding them in algebraic terms. In this talk, we give a brief overview of some iconic modern...

Let $T$ be a tree in which no vertex has degree $2$. A Halin graph is a planar graph obtained by connecting all leaves of $T$ into a cycle in their planar order. The idea of universal originates from a question of John W. Moon (1965). Consider all...

This Alternative Math Education event will present fun methods of teaching math and computer science concepts to children (and adults!) using games and art. Lots of hands-on activities! Including: A Sorting Network An Impossible Balancing Act Bubbles...

Tentative Schedule : Friday, August 14 5:00 pm – BBQ on Campus – Outside DSB - David Strong Building 6:45 pm – 7:00 pm – Brief Outline of the Hackathon (that will take place on Sunday) 7:00 pm – 8:00 pm – Icebreaker – Group problem solving Saturday...