Carla Groenland

activity

20232026

most citedLongest cycles in vertex-transitive and highly connected graphs

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

collaborators

13 papers

math.CO2026

Poset dimension and maximum comparability degree

Carla Groenland, Richard Montgomery, Rajko Nenadov +1

In 1986, Füredi and Kahn showed that the dimension $dim (P)$ of any finite poset $P$ satisfies $dim (P) = O (d lo g^{2} d)$ , where $d$ is the maximum degree of the comparability graph…

math.CO2026

Faster 3-colouring algorithm for graphs of diameter 3

Carla Groenland, Hidde Koerts, Sophie Spirkl

We show that given an $n$ -vertex graph $G$ of diameter 3 we can decide if $G$ is $3$ -colourable in time $2^{O (n^{2/3 - ε})}$ for any $ε < 1/33$ . This improves on…

cs.DS2025

Improved exploration of temporal graphs

Paul Bastide, Carla Groenland, Lukas Michel +1

A temporal graph $G$ is a sequence $(G_{t})_{t \in I}$ of graphs on the same vertex set of size $n$ . The \emph{temporal exploration problem} asks for the length of the shortest seque…

math.CO2025

Circular sorting, strong complete mappings and wreath product constructions

Paul Bastide, Anurag Bishnoi, Carla Groenland +2

We continue the study of Adin, Alon and Roichman [arXiv:2502.14398, 2025] on the number of steps required to sort $n$ labelled points on a circle by transpositions. Imagine that th…

math.CO2025

Smaller universal posets

Paul Bastide, Carla Groenland, Rajko Nenadov

We show that there is a constant $C > 0$ such that for each integer $n \geq 1$ , there is a poset on at most $2^{2 n /3 + C n}$ elements that contains each $n$ -element poset as an (i…

math.CO2025

Note on extremal problems about connected subgraph sums

Stijn Cambie, Carla Groenland

For a graph $G$ with vertex assignment $c : V (G) \to Z^{+}$ , we define $\sum_{v \in V (H)} c (v)$ for $H$ a connected subgraph of $G$ as a connected subgraph sum of $G$ . We study t…