Unlabeled rooted trees

Content created by Fredrik Bakke, Jonathan Prieto-Cubides and Egbert Rijke.

Created on 2022-06-18.
Last modified on 2023-09-10.

module univalent-combinatorics.unlabeled-rooted-trees where

Idea

An unlabeled rooted tree is an unlabeled tree equipped with a vertex.

Definition

This remains to be defined. #749

Recent changes

• 2023-09-10. Fredrik Bakke. Link issues to unfinished sections (#732).
• 2023-06-08. Fredrik Bakke. Examples of modalities and various fixes (#639).
• 2023-05-28. Fredrik Bakke. Enforce even indentation and automate some conventions (#635).
• 2023-03-07. Fredrik Bakke. Add blank lines between <details> tags and markdown syntax (#490).
• 2023-03-07. Jonathan Prieto-Cubides. Show module declarations (#488).