Jérémie Turcotte

The burning number $b(G)$ of a graph $G$ is the smallest number of turns required to burn all vertices of a graph if at every turn a new fire is started and existing fires spread to all adjacent vertices. The Burning Number Conjecture of Bonato et al. (2016) postulates that $b(G)\leq \left\lceil\sqrt{n}\right\rceil$ for all graphs $G$ on $n$ vertic...

We show that the cop number of any graph on 18 or fewer vertices is at most 3. This answers a question posed by Andreae in 1986, as well as more recently by Baird et al. We also find all 3-cop-win graphs on 11 vertices, narrow down the possible 4-cop-win graphs on 19 vertices and make some progress on finding the minimum order of 3-cop-win planar g...

We show that the cop number of directed and undirected Cayley graphs on abelian groups is in O(n), where n is the number of vertices, by introducing a refined inductive method. With our method, we improve the previous upper bound on cop number for undirected Cayley graphs on abelian groups, and we establish an upper bound on the cop number of direc...

We prove Menger-type results in which the obtained paths are pairwise non-adjacent, both for graphs of bounded maximum degree and, more generally, for graphs excluding a topological minor. We further show better bounds in the subcubic case, and in particular obtain a tight result for two paths using a computer-assisted proof.

Motivated by Hadwiger's conjecture, Seymour asked which graphs $H$ have the property that every non-null graph $G$ with no $H$ minor has a vertex of degree at most $|V(H)|-2$. We show that for every monotone graph family $\mathcal{F}$ with strongly sublinear separators, all sufficiently large bipartite graphs $H \in \mathcal{F}$ with bounded maximu...

We prove Menger-type results in which the obtained paths are pairwise non-adjacent, both for graphs of bounded maximum degree and, more generally, for graphs excluding a topological minor. More precisely, we show the existence of a constant $C$, depending only on the maximum degree or on the forbidden topological minor, such that for any pair of se...

Andreae proved that the cop number of connected ‐minor‐free graphs is bounded for every graph . In particular, the cop number is at most if contains no isolated vertex, where . The main result of this paper is an improvement on this bound, which is most significant when is small or sparse, for instance, when can be obtained from another graph by mu...

Motivated by Hadwiger's conjecture, we study the problem of finding the densest possible ‐vertex minor in graphs of average degree at least . We show that if has average degree at least , it contains a minor on vertices with at least edges. We show that this cannot be improved beyond . Finally, for we exactly determine the number of edges we are gu...

We present progress on two old conjectures about longest cycles in graphs. The first conjecture, due to Thomassen from 1978, states that apart from a finite number of exceptions, all connected vertex-transitive graphs contain a Hamiltonian cycle. The second conjecture, due to Smith from 1984, states that for $r\ge 2$ in every $r$-connected graph an...

Motivated by Hadwiger's conjecture, we study the problem of finding the densest possible $t$-vertex minor in graphs of average degree at least $t-1$. We show that if $G$ has average degree at least $t-1$, it contains a minor on $t$ vertices with at least $(\sqrt{2}-1-o(1))\binom{t}{2}$ edges. We show that this cannot be improved beyond $\left(\frac...

Andreae (1986) proved that the cop number of connected $H$-minor-free graphs is bounded for every graph $H$. In particular, the cop number is at most $|E(H-h)|$ if $H-h$ contains no isolated vertex. The main result of this paper is an improvement on this bound, which is most significant when $H$ is small or sparse, for instance when $H-h$ can be ob...

We prove that every connected $P_5$-free graph has cop number at most two, solving a conjecture of Sivaraman. In order to do so, we first prove that every connected $P_5$-free graph $G$ with independence number at least three contains a three-vertex induced path with vertices $a \hbox{-} b \hbox{-} c$ in order, such that every neighbour of $c$ is a...

We prove that the cop number of any 2K2-free graph is at most 2, proving a conjecture of Sivaraman and Testa. We also show that the upper bound of 3 on the cop number of 2K1+K2-free (co-diamond–free) graphs is best possible.

We investigate random compact sets with random functions defined thereon, such as polynomials, rational functions, the pluricomplex Green function and the Siciak extremal function. One surprising consequence of our study is that randomness can be used to `improve' convergence for sequences of functions.

We show that the cop number of any graph on 18 or fewer vertices is at most 3. This answers a specific case of a question posed by Baird et al. on the minimum order of 4-cop-win graphs, first appearing in 2011. We also find all 3-cop-win graphs on 11 vertices, narrow down the possible 4-cop-win graphs on 19 vertices and get some progress on finding...

We prove that the cop number of any $2K_2$-free graph is at most 2, which was previously conjectured by Sivaraman and Testa.

We show that the cop number of directed and undirected Cayley graphs on abelian groups has an upper bound of the form of $O(\sqrt{n})$, where $n$ is the number of vertices, by introducing a refined inductive method. With our method, we improve the previous upper bound on cop number for undirected Cayley graphs on abelian groups, and we establish an...

We seek random versions of some classical theorems on complex approximation by polynomials and rational functions, as well as investigate properties of random compact sets in connection to complex approximation.

We seek random versions of some classical theorems on complex approximation by polynomials and rational functions, as well as investigate properties of random compact sets in connection to complex approximation.