32 citations · 49 across the 13 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2023
The Ulam-Hammersley problem for multiset permutations
Lucas Gerin
We obtain the asymptotic behaviour of the longest increasing/non-decreasing subsequences in a random uniform multiset permutation in which each element in {1,...,n} occurs k times,…
math.CO2021★ 10 cited
Linear-sized independent sets in random cographs and increasing subsequences in separable permutations
Frédérique Bassino, Mathilde Bouvel, Michael Drmota +4
This paper is interested in independent sets (or equivalently, cliques) in uniform random cographs. We also study their permutation analogs, namely, increasing subsequences in unif…
math.CO2019
Random cographs: Brownian graphon limit and asymptotic degree distribution
Frédérique Bassino, Mathilde Bouvel, Valentin Féray +3
We consider uniform random cographs (either labeled or unlabeled) of large size. Our first main result is the convergence towards a Brownian limiting object in the space of graphon…