Exact digraph enumeration

Speaker :	Élie de Panafieu
	Nokia Bell Labs France
Date:	06/11/2019
Time:	10:30 am - 12:00 pm
Location:	Doctoral Training Center (EIT Digital)

Abstract

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.