100 citations · 275 across the 26 of their papers we have counts for
30 papers · 1 filter
Chordal graphs with bounded tree-width
Jordi Castellví, Michael Drmota, Marc Noy +1
Given and , we prove that the number of labelled -connected chordal graphs with vertices and tree-width at most is asymptotically $c n^{-5/2} γ^…
Random cubic planar maps
Michael Drmota, Marc Noy, Clément Requilé +1
We analyse uniform random cubic rooted planar maps and obtain limiting distributions for several parameters of interest. From the enumerative point of view, we present a unified ap…
A logical limit law for -avoiding permutations
Michael Albert, Mathilde Bouvel, Valentin Féray +1
We prove that the class of 231-avoiding permutations satisfies a logical limit law, i.e. that for any first-order sentence , in the language of two total orders, the probability…
Enumeration of rooted 3-connected bipartite planar maps
Marc Noy, Clément Requilé, Juanjo Rué
We provide the first solution to the problem of counting rooted 3-connected bipartite planar maps. Our starting point is the enumeration of bicoloured planar maps according to the…
Enumeration of chordal planar graphs and maps
Jordi Castellví, Marc Noy, Clément Requilé
We determine the number of labelled chordal planar graphs with vertices, which is asymptotically for a constant and . We a…
Limiting probabilities of first order properties of random sparse graphs and hypergraphs
Alberto Larrauri, Tobias Müller, Marc Noy
Let be the binomial random graph in the sparse regime, which as is well-known undergoes a phase transition at . Lynch (Random Structures Algorithms, 1992) s…