BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//7.2.3.1//EN
BEGIN:VEVENT
UID:509@lincs.fr
DTSTART;TZID=Europe/Paris:20191106T103000
DTEND;TZID=Europe/Paris:20191106T120000
DTSTAMP:20191029T111551Z
URL:https://www.lincs.fr/events/exact-digraph-enumeration/
SUMMARY:Exact digraph enumeration
DESCRIPTION:We present exact formulas for the number of digraphs in various
 interesting families: acyclic digraphs (dags)\, strongly connected
 digraphs\, digraphs with constraints on their strongly connected
 components. They are obtained through generating function manipulations and
 were first discovered by Wright\, Liskovets and Robinson.
CATEGORIES:Network Theory,Working Group
LOCATION:Doctoral Training Center (EIT Digital)\, 23\, avenue d'Italie\,
 Paris\, 75013\, France
GEO:48.8283983;2.3568972000000485
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\,
 Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Doctoral Training Center
 (EIT Digital):geo:48.8283983,2.3568972000000485
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Paris
X-LIC-LOCATION:Europe/Paris
BEGIN:STANDARD
DTSTART:20191027T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
END:STANDARD
END:VTIMEZONE
END:VCALENDAR