9 citations · 11 across the 3 of their papers we have counts for
4 papers · 1 filter
Maximal independent sets and maximal matchings in series-parallel and related graph classes
Michael Drmota, Lander Ramos, Clément Requilé +1
The goal of this paper is to obtain quantitative results on the number and on the size of maximal independent sets and maximal matchings in several block-stable graph classes that…
Subgraph statistics in subcritical graph classes
Michael Drmota, Lander Ramos, Juanjo Rué
Let be a fixed graph and a subcritical graph class. In this paper we show that the number of occurrences of (as a subgraph) in a uniformly at random graph of…
Graphs with degree constraints
Élie de Panafieu, Lander Ramos
Given a set D of nonnegative integers, we derive the asymptotic number of graphs with a givenvnumber of vertices, edges, and such that the degree of every vertex is in D. This gene…
Random planar maps and graphs with minimum degree two and three
Marc Noy, Lander Ramos
We find precise asymptotic estimates for the number of planar maps and graphs with a condition on the minimum degree, and properties of random graphs from these classes. In particu…