32 citations · 63 across the 20 of their papers we have counts for
5 papers · 1 filter
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…
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…
An algorithm computing combinatorial specifications of permutation classes
Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot +2
This article presents a methodology that automatically derives a combinatorial specification for a permutation class C, given its basis B of excluded patterns and the set of simple…
An algorithm for deciding the finiteness of the number of simple permutations in permutation classes
Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot +1
In this article, we describe an algorithm to determine whether a permutation class C given by a finite basis B of excluded patterns contains a finite number of simple permutations.…
Combinatorial specification of permutation classes
Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot +2
This article presents a methodology that automatically derives a combinatorial specification for the permutation class C = Av(B), given its basis B of excluded patterns and the set…