This is an archived version pinned as of the submission of my master's thesis. An up-to-date version may be found online.

Unlabeled trees

module univalent-combinatorics.unlabeled-trees where

Idea

An unlabeled tree is an undirected graph G such that any cycle in G must have length 1.