Unlabeled trees

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

Created on 2022-06-18.
Last modified on 2023-06-08.

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.

Recent changes

• 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-14. Fredrik Bakke. Remove all unused imports (#502).
• 2023-03-13. Jonathan Prieto-Cubides. More maintenance (#506).
• 2023-03-07. Fredrik Bakke. Add blank lines between <details> tags and markdown syntax (#490).