3 papers
math.CO2021
Digraphs with exactly one Eulerian tour
Luz Grisales, Antoine Labelle, Rodrigo Posada +1
We give two combinatorial proofs of the fact that the number of loopless digraphs on the vertex set with no isolated vertices and with exactly one Eulerian tour up to a cycli…
math.CO2020
Extremal results for graphs of bounded metric dimension
Jesse Geneson, Suchir Kaustav, Antoine Labelle
Metric dimension is a graph parameter motivated by problems in robot navigation, drug design, and image processing. In this paper, we answer several open extremal problems on metri…
math.CO2020
Ulam Sets in New Settings
Tej Bade, Kelly Cui, Antoine Labelle +1
The classical Ulam sequence is defined recursively as follows: , , and , for , is the smallest integer not already in the sequence that can be written uni…