University of Victoria

The distinguishing number of a graph is the smallest number of colors necessary to color the vertices so that no nontrivial automorphism preserves the color classes. If a graph can be distinguished with two colors, the distinguishing cost is the...

Join us for this event, part of the Seminar Series: Mathematics of Ethical Decision-making Systems. Agenda 3:00pm Dr. Midori Ogasawara, the social consequences of surveillance and data collection. 3:30pm Break for refreshments 4:00pm Patricia Cochran...

Products of permutations are used to model problems in fields ranging from representation theory and algebraic geometry to topological graph theory. I will show how probability can be used to study such problems, with a focus on how graphs may be...

We introduce a model of a controlled random process. In this model, the vertices of a hypergraph are ordered randomly and then revealed, one by one, to an algorithm. The algorithm must decide, immediately and irrevocably, whether to keep each...

It is well known that a maximal planar graph of order at least 3 is 3-colourable if and only if it is Eulerian. It is also known that if a maximal planar graph of order at least 3 has exactly two vertices of odd degree, then these vertices are...

Join us for this event, part of the Seminar Series: Mathematics of Ethical Decision-making Systems

A broadcast on a connected graph G with vertex set V(G) is a function f:V(G) ➛ {0, 1, ..., diam(G)} such that f(v) ≤ e(v), where e(v) denotes the eccentricity of v. If f(v) > 0, the vertex v is said to broadcast at strength f(v). In generalizing...

Prediction systems face exogenous and endogenous distribution shift -- the world constantly changes, and the predictions the system makes change the environment in which it operates. For example, a music recommender observes exogeneous changes in the...

The first two problems are concerning edge-colorings of complete graphs. Erd\H{o}s and Tuza asked in 1993 whether for any graph F on l edges and any completely balanced coloring of any sufficiently large complete graph using l colors contains a...

Given a finite simple graph $G$, an {\em odd cover of $G$} is a collection of complete bipartite graphs, or bicliques, in which each edge of $G$ appears in an odd number of bicliques and each non-edge of $G$ appears in an even number of bicliques. We...