Mathias Marty

Counting Successor-Closed Subsets of Functional Digraphs

A functional digraph is a directed graph where each vertex has an out-degree of at most 1. We study the number of successor-closed subsets of a functional digraph, that is, subsets from which no edge leaves. We show that functional digraphs have a simple recursive formula for their corresponding generating function. Us...