BIRS Workshop Lecture Videos
Analytic combinatorics of graphs with marked subgraphs de Panafieu, Élie
We present a new proof of a result from Erdős and Rényi on the enumeration of graphs where a given subgraph is forbidden. It is based on generating function manipulations. Joint work in progress, with Gwendal Collet, Danièle Gardy, Bernhard Gittenberger and Vlady Ravelomanana.
Item Citations and Data
Attribution-NonCommercial-NoDerivatives 4.0 International