3 papers
cs.DS2025
Isometric-Universal Graphs for Trees
Edgar Baucher, François Dross, Cyril Gavoille
We consider the problem of finding the smallest graph that contains two input trees each with at most vertices preserving their distances. In other words, we look for an isomet…
math.CO2023
Computing pivot-minors
Konrad K. Dabrowski, François Dross, Jisu Jeong +4
A graph contains a graph as a pivot-minor if can be obtained from by applying a sequence of vertex deletions and edge pivots. Pivot-minors play an important role in…
math.CO2020
Powers of paths in tournaments
Nemanja Draganić, François Dross, Jacob Fox +7
In this short note we prove that every tournament contains the -th power of a directed path of linear length. This improves upon recent results of Yuster and of Girão. We also g…