University of Victoria

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...

For more information about this event, please see the conference website. This conference will bring together experts in various aspects of four-dimensional topology. Themes include diffeomorphism groups of four-manifolds, construction and detection...

Convective storms are highly intermittent and intense, making their occurrence and strength difficult to predict. This is especially true for climate models, which have grid resolutions much coarser (e.g., 100 km) than the scale of a storm’s...

Monitoring marked individuals is a common strategy in studies of wild animals (referred to as mark-recapture or capture-recapture experiments) and hard to track human populations (referred to as multi-list methods or multiple-systems estimation). A...

Nati Linial raised the following basic problem in 2006: given a k-dimensional simplicial complex S, how many facets can a k-complex on n vertices have if it contains no topological copy of S? This is a beautiful and natural question, but results in...

The Erdos-Hajnal conjecture states that for every graph H there exists $c > 0$ such that every n-vertex graph $G$ either contains $H$ as an induced subgraph, or has a clique or stable set of size at least $n^c$. I will talk about a proof of this...