University of Victoria

In 2021, Mohar introduced the game of Cops and Robber on geodesic spaces. The game captures the behavior of the Cops and Robber game played on graphs and that of continuous pursuit-evasion games. Analogous to one of the main open problems for the...

Given two graphs H and G, the homomorphism density t(H,G) represents the likelihood that a random mapping from V(H) to V(G) is a homomorphism. Sidorenko Conjecture states that for any bipartite graph H, t(H,G) is greater or equal to t(K_2,G)^{e(H)}...

Response optimization is a process of identifying the input variable settings that optimize the response. Multistratum design arises naturally in industrial experiments due to the inconvenient and impractical completely randomization. Accounting for...

Single-cell omics data play a pivotal role in identifying cell-to-cell heterogeneity, understanding cell differentiation, unveiling cell population structures, and ultimately deciphering disease pathogenesis. Due to inherent high-dimensionality...

In this talk, I will present a recent work in which two co-authors and myself studied the behaviour of a local algorithm optimizing the weight of a graph. More precisely, the process starts with a given subgraph H of the complete graph with uniform...

Turán-type problems for hypergraphs have been an intriguing area of research. Despite significant efforts, the Turán density of F is known for only a few three-uniform hypergraphs F. This talk concerns Turán-type problems for 3-uniform tight cycles C...

Given graphs $G$ and $H$ and a positive integer $q$, an $(H,q)$-coloring of $G$ is an edge-coloring in which each copy of $H$ receives at least $q$ colors. Erdős and Shelah raised the question of determining the minimum number of colors, $f(G,H,q)$...

We consider a class of disordered mean-field combinatorial optimization problems, focusing on the Gibbs measure, where the inverse temperature does not vary with the size of the graph and the edge weights are sampled from a general distribution. We...

"Double dipping" is the practice of using the same data to fit and validate a model. Problems typically arise when standard statistical procedures are applied in settings involving double dipping. To avoid the challenges surrounding double dipping, a...

For every $k\ge 2$ and $\Delta$, we prove that there exists a constant $C_{\Delta,k}$ such that the following holds. For every graph $H$ with $\chi(H)=k$ and every tree with at least $C_{\Delta,k}|H|$ vertices and maximum degree at most $\Delta$, the...