Candida Bowtell

collaborators

3 papers

math.CO2026

A proof of Andersen's rainbow path conjecture for large $n$

Candida Bowtell, Richard Montgomery, Alp Müyesser +1

We show that, for sufficiently large $n$ , every properly edge-coloured $n$ -vertex complete graph contains a path with $n - 1$ vertices which uses each colour at most once (that is, a…

math.CO2026

Universality for transversal Hamilton cycles

Candida Bowtell, Patrick Morris, Yanitsa Pehova +1

Let $G = {G_{1}, \dots, G_{m}}$ be a graph collection on a common vertex set $V$ of size $n$ such that $I^´ (G_{i}) \geq (1 + o (1)) n /2$ for every $i \in [m]$ . We show that $\mathbf…

math.CO2025

Almost every Latin square has a decomposition into transversals

Candida Bowtell, Richard Montgomery

In 1782, Euler conjectured that no Latin square of order $n \equiv 2 mod 4$ has a decomposition into transversals. While confirmed for $n = 6$ by Tarry in 1900, Bose, Par…

A proof of Andersen's rainbow path conjecture for large n

Universality for transversal Hamilton cycles

Almost every Latin square has a decomposition into transversals

A proof of Andersen's rainbow path conjecture for large $n$