Even and odd plane labelled bipartite trees
classification
🧮 math.CO
keywords
treesevenbipartitelabelledplanesubsetverticesblack
read the original abstract
Let $T(n,m)$ be the set of all plane labelled bipartite trees with $n$ white vertices and $m$ black. If the number $n+m$ of vertices is even, then the set $T(n,m)$ is a union of two disjoint subsets --- subset od "even" trees and subset of "odd" trees. This partition has a clear geometric meaning.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.