Carla Groenland

collaborators

4 papers

math.CO2025

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.CO2025

Infinite induced-saturated graphs

Marthe Bonamy, Carla Groenland, Tom Johnston +2

A graph $G$ is $H$ -induced-saturated if $G$ is $H$ -free but deleting any edge or adding any edge creates an induced copy of $H$ . There are non-trivial graphs $H$ , such as $P_{4}$ , fo…

math.CO2024

Counting graphic sequences via integrated random walks

Paul Balister, Serte Donderwinkel, Carla Groenland +2

Given an integer $n$ , let $G (n)$ be the number of integer sequences $n - 1 \geq d_{1} \geq d_{2} \geq \dots \geq d_{n} \geq 0$ that are the degree sequence of some graph. We show that $G(n)=(c+o(1))…

math.CO2024

A Polynomial Upper Bound for Poset Saturation

Paul Bastide, Carla Groenland, Maria-Romina Ivan +1

Given a finite poset $P$ , we say that a family $F$ of subsets of $[n]$ is $P$ -saturated if $F$ does not contain an induced copy of $P$ ,…