English

Even and odd plane labelled bipartite trees

Combinatorics 2016-11-04 v1

Abstract

Let T(n,m)T(n,m) be the set of all plane labelled bipartite trees with nn white vertices and mm black. If the number n+mn+m of vertices is even, then the set T(n,m)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.

Keywords

Cite

@article{arxiv.1611.01010,
  title  = {Even and odd plane labelled bipartite trees},
  author = {Yury Kochetkov},
  journal= {arXiv preprint arXiv:1611.01010},
  year   = {2016}
}

Comments

8 pages, 10 figures

R2 v1 2026-06-22T16:40:56.328Z