Jamie Radcliffe

activity

20182023

most citedStability and Erdős--Stone type results for

F

-free graphs with a fixed number of edges

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

collaborators

Showing 2022Show all

4 papers · 1 filter

cs.DM2022

Geometry of Rounding

Jason Vander Woude, Peter Dixon, A. Pavan +2

Rounding has proven to be a fundamental tool in theoretical computer science. By observing that rounding and partitioning of $R^{d}$ are equivalent, we introduce the followi…

math.CO2022

Perfect shuffling with fewer lazy transpositions

Carla Groenland, Tom Johnston, Jamie Radcliffe +1

A lazy transposition $(a, b, p)$ is the random permutation that equals the identity with probability $1 - p$ and the transposition $(a, b) \in S_{n}$ with probability $p$ . How long must a…

math.CO2022

Short reachability networks

Carla Groenland, Tom Johnston, Jamie Radcliffe +1

We investigate the following generalisation of permutation networks. We say a sequence $T = (T_{1}, \dots, T_{ℓ})$ of transpositions in $S_{n}$ forms a $t$ -reachability network if, for ev…

math.CO2022

Many cliques in bounded-degree hypergraphs

Rachel Kirsch, Jamie Radcliffe

Recently Chase determined the maximum possible number of cliques of size $t$ in a graph on $n$ vertices with given maximum degree. Soon afterward, Chakraborti and Chen answered the…