4 papers
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…
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…
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…
Random embeddings of bounded degree trees with optimal spread
Paul Bastide, Clément Legrand-Duchesne, Alp Müyesser
A seminal result of Komlós, Sárközy, and Szemerédi states that any n-vertex graph G with minimum degree at least (1/2 + α)n contains every n-vertex tree T of bounded degree. Recent…