22 citations · 26 across the 5 of their papers we have counts for
6 papers · 1 filter
Threshold functions for small subgraphs in simple graphs and multigraphs
Gwendal Collet, Élie de Panafieu, Danièle Gardy +2
We revisit the problem of counting the number of copies of a fixed graph in a random graph or multigraph, for various models of random (multi)graphs. For our proofs we introduce th…
Threshold functions for small subgraphs: an analytic approach
Gwendal Collet, Élie de Panafieu, Danièle Gardy +2
We revisit the problem of counting the number of copies of a fixed graph in a random graph or multigraph, including the case of constrained degrees. Our approach relies heavily on…
2-Xor revisited: satisfiability and probabilities of functions
Élie de Panafieu, Danièle Gardy, Bernhard Gittenberger +1
The problem 2-Xor-Sat asks for the probability that a random expression, built as a conjunction of clauses , is satisfiable. We revisit this classical problem by giving…
On the number of unary-binary tree-like structures with restrictions on the unary height
Olivier Bodini, Danièle Gardy, Bernhard Gittenberger +1
We consider various classes of Motzkin trees as well as lambda-terms for which we derive asymptotic enumeration results. These classes are defined through various restrictions conc…
Enumeration of generalized lambda-terms
Olivier Bodini, Danièle Gardy, Bernhard Gittenberger +1
We investigate the asymptotic number of elements of size in a particular class of closed lambda-terms (so-called -terms) which are related to axiom systems of combinato…
Generating functions for generating trees
Cyril Banderier, Philippe Flajolet, Daniele Gardy +3
Certain families of combinatorial objects admit recursive descriptions in terms of generating trees: each node of the tree corresponds to an object, and the branch leading to the n…