2 problems

For each $n$, consider the set of unlabelled isomorphism classes of trees with $n$ nodes. For a tree $T$, let $\mathcal{B}(T)$ be its graphical building set and let…

For a finite undirected graph $G$, let $\mathsf{B}$ be the graphical pointed building set of $G$, and let $\operatorname{Bicl}(\mathsf{B})$ denote the subposet of biclosed ornament…