Assertion: tree's vertex | /r/HasProperty | labeled in x \displaystyle x
Facets:
Source sentences:
text: If T 1 , T 2 {\displaystyle T_{1},T_{2}} are rooted trees with vertices labeled in X {\displaystyle X} , we say that T 1 {\displaystyle T_{1}} is inf-embeddable in T 2 {\displaystyle T_{2}} and write T 1 ≤ T 2 {\displaystyle T_{1}\leq T_{2}} if there is an injective map F {\displaystyle F} from the vertices of T 1 {\displaystyle T_{1}} to the vertices of T 2 {\displaystyle T_{2}} such that