activity
20242026
collaborators

8 papers

math.CO2026

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 labelled points on a circle by transpositions. Imagine that th…

math.CO2026

Smaller universal posets

Paul Bastide, Carla Groenland, Rajko Nenadov

We show that there is a constant such that for each integer , there is a poset on at most elements that contains each -element poset as an (i…

math.CO2026

Faithful universal graphs for minor-closed classes

Paul Bastide, Louis Esperet, Carla Groenland +3

It was proved by Huynh, Mohar, Šámal, Thomassen and Wood in 2021 that any countable graph containing every countable planar graph as a subgraph has an infinite clique minor. We p…

cs.DS2025

Improved exploration of temporal graphs

Paul Bastide, Carla Groenland, Lukas Michel +1

A temporal graph is a sequence of graphs on the same vertex set of size . The \emph{temporal exploration problem} asks for the length of the shortest seque…

math.CO2025

Counterexamples to statements on isometric graph coverings

Paul Bastide, Julien Duron, Jędrzej Hodor +2

A connected subgraph of a graph is isometric if it preserves distances. In this short note, we provide counterexamples to several variants of the following general question: When a…

math.CO2025

Cube Height, Cube Width and Related Extremal Problems for Posets

Paul Bastide, Jędrzej Hodor, Hoang La +1

Given a poset , a family of sets indexed by the elements of is called an inclusion representation of if in if and only if…