BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//7.2.3.1//EN
BEGIN:VEVENT
UID:720@lincs.fr
DTSTART;TZID=Europe/Paris:20220615T110000
DTEND;TZID=Europe/Paris:20220615T120000
DTSTAMP:20221010T100243Z
URL:https://www.lincs.fr/events/enumerating-bipartite-graphs-with-degree-c
 onstraints/
SUMMARY:Enumerating Bipartite Graphs With Degree Constraints
DESCRIPTION:Enumerating graphs with a given degree sequence is a problem of
 interest in many fields such as voting theory and statistics. If we are
 able to give nice asymptotic formulas [1]\, there does not exist an exact
 formula that is feasible to compute. Even though asymptotics already
 provides sufficient information for most applications\, some require an
 exact enumeration. In this presentation\, we will enumerate bipartite
 graphs with degree constraints using a special combinatorial technique.
 This will be the occasion to make an introduction to some classical
 combinatorial tools such as generating functions [2].\n\n[1] Asymptotic
 enumeration of digraphs and bipartite graphs by degree sequence\, A
 Liebenau\, N Wormald\, 2020\n[2] Analytic combinatorics\, P Flajolet\, R
 Sedgewick\, 2009
CATEGORIES:Network Theory,Working Group,Youtube
LOCATION:Telecom Paristech\, 19 place marguerite perey\, Palaiseau\,
 91120\, France
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place marguerite perey\,
 Palaiseau\, 91120\, France;X-APPLE-RADIUS=100;X-TITLE=Telecom
 Paristech:geo:0,0
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Paris
X-LIC-LOCATION:Europe/Paris
BEGIN:DAYLIGHT
DTSTART:20220327T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
END:DAYLIGHT
END:VTIMEZONE
END:VCALENDAR