Candida Bowtell

activity

20182026

most citedProof of the Kohayakawa--Kreuter conjecture for the majority of cases

1 citations · 2 across the 7 of their papers we have counts for

collaborators

9 papers

math.CO2026

Improved bounds on completion of partial Latin squares

Jack Allsop, Candida Bowtell, Thomas Lesgourgues +1

A Latin square of order $n$ is an $n \times n$ array filled with $n$ symbols so that each symbol appears exactly once in every row and column. A partial Latin square of order $n$ i…

math.CO2025

Perfect tilings of 3-graphs with the generalised triangle

Candida Bowtell, Amarja Kathapurkar, Natasha Morrison +1

We establish a best-possible minimum codegree condition for the existence of a perfect tiling of a $3$ -uniform hypergraph $H$ with copies of the generalised triangle $T$ , which is…

math.CO2025

Extendibility of Latin Hypercuboids

Candida Bowtell, Alice Devillers, André Kündgen +2

A Latin hypercuboid of order $n$ is a $d$ -dimensional matrix of dimensions $n \times n \times \dots \times n \times k$ , with symbols from a set of cardinality $n$ such that each symbol…

math.CO2025

A note on improved bounds for hypergraph rainbow matching problems

Candida Bowtell, Andrea Freschi, Gal Kronenberg +1

A natural question, inspired by the famous Ryser-Brualdi-Stein Conjecture, is to determine the largest positive integer $g (r, n)$ such that every collection of $n$ matchings, each o…

math.CO2024

Matchings in multipartite hypergraphs

Candida Bowtell, Richard Mycroft

A folklore result on matchings in graphs states that if $G$ is a bipartite graph whose vertex classes $A$ and $B$ each have size $n$ , with $deg (u) \geq a$ for every $u \in…

math.CO2023★ 1 cited

Proof of the Kohayakawa--Kreuter conjecture for the majority of cases

Candida Bowtell, Robert Hancock, Joseph Hyde

For graphs $G, H_{1}, \dots, H_{r}$ , write $G \to (H_{1}, \dots, H_{r})$ to denote the property that whenever we $r$ -colour the edges of $G$ , there is a monochromatic copy of $H_{i}$ in colou…

math.CO2021★ 1 cited

The $n$ -queens problem

Candida Bowtell, Peter Keevash

The famous $n$ -queens problem asks how many ways there are to place $n$ queens on an $n \times n$ chessboard so that no two queens can attack one another. The toroidal $n$ -queens p…

math.CO2020

A degree sequence strengthening of the vertex degree threshold for a perfect matching in 3-uniform hypergraphs

Candida Bowtell, Joseph Hyde

The study of asymptotic minimum degree thresholds that force matchings and tilings in hypergraphs is a lively area of research in combinatorics. A key breakthrough in this area was…

math.CO2018

Classification of maximum hittings by large families

Candida Bowtell, Richard Mycroft

For integers $r$ and $n$ , where $n$ is sufficiently large, and for every set $X \subseteq [n]$ we determine the maximal left-compressed intersecting families $\mathcal{A}\subseteq…

Improved bounds on completion of partial Latin squares

Perfect tilings of 3-graphs with the generalised triangle

Extendibility of Latin Hypercuboids

A note on improved bounds for hypergraph rainbow matching problems

Matchings in multipartite hypergraphs

Proof of the Kohayakawa--Kreuter conjecture for the majority of cases

The n-queens problem

A degree sequence strengthening of the vertex degree threshold for a perfect matching in 3-uniform hypergraphs

Classification of maximum hittings by large families

The $n$ -queens problem