Counting embeddings of rooted trees into families of rooted trees

Bernhard Gittenberger, Zbigniew Gołębiewski, Isabella Larcher +1

The number of embeddings of a partially ordered set $S$ in a partially ordered set $T$ is the number of subposets of $T$ isomorphic to $S$. If both, $S$ and $T$, have only one uniq…