Title	Analytic combinatorics of graphs with marked subgraphs
Creator	de Panafieu, Élie
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2016-10-24T16:49
Description	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.
Extent	25 minutes
Subject	Mathematics; Combinatorics; Probability theory and stochastic processes; Control/optimization/operation research
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: Université Pierre et Marie Curie
Series	BIRS Workshop Lecture Videos (Banff, Alta)
Date Available	2017-04-25
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0345648
URI	http://hdl.handle.net/2429/61382
Affiliation	Non UBC
Peer Review Status	Unreviewed
Scholarly Level	Postdoctoral
Rights URI	http://creativecommons.org/licenses/by-nc-nd/4.0/
Aggregated Source Repository	DSpace

Open Collections

BIRS Workshop Lecture Videos