119 citations · 207 across the 21 of their papers we have counts for
3 papers · 1 filter
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…
Generating Functions For Kernels of Digraphs (Enumeration & Asymptotics for Nim Games)
Cyril Banderier, Jean-Marie Le Bars, Vlady Ravelomanana
In this article, we study directed graphs (digraphs) with a coloring constraint due to Von Neumann and related to Nim-type games. This is equivalent to the notion of kernels of dig…
Why Delannoy numbers?
Cyril Banderier, Sylviane Schwer
This article is not a research paper, but a little note on the history of combinatorics: We present here a tentative short biography of Henri Delannoy, and a survey of his most not…