3 citations · 7 across the 7 of their papers we have counts for
6 papers · 1 filter
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…
Normal limiting distributions for systems of linear equations in random sets
Juanjo Rué, Maximilian Wötzel
We consider the binomial random set model where each element in is chosen independently with probability . We show that for essentially all regimes…
On the expected number of perfect matchings in cubic planar graphs
Marc Noy, Clément Requilé, Juanjo Rué
A well-known conjecture by Lovász and Plummer from the 1970s asserted that a bridgeless cubic graph has exponentially many perfect matchings. It was solved in the affirmative by Es…
Cycles of given lengths in unicyclic components in sparse random graphs
Marc Noy, Vonjy Rasendrahasina, Vlady Ravelomanana +1
Let be subset of and let be the number of cycles belonging to unicyclic components whose length is in in the random graph . We find…
On strong infinite Sidon and sets and random sets of integers
David Fabian, Juanjo Rué, Christoph Spiegel
A set of integers is an -strong Sidon set if the pairwise sums of its elements are far apart by a certain measure depending on , more specifically if $…
Further results on random cubic planar graphs
Marc Noy, Clément Requilé, Juanjo Rué
We provide precise asymptotic estimates for the number of several classes of labelled cubic planar graphs, and we analyze properties of such random graphs under the uniform distrib…