File:Tree-polygon-paren equivalence.svg
Summary
| Description |
English: The combinatorial equivalence between the partitions of an (n + 1)-gon into smaller polygons by adding diagonals, the plane trees with n leaves and with each internal node having two or more children, and the parenthesizations of a sequence of n symbols, counted by the Schröder–Hipparchus numbers |
| Date | |
| Source | Own work |
| Author | David Eppstein |
Licensing
I, the copyright holder of this work, hereby publish it under the following license:
  |
This file is made available under the Creative Commons CC0 1.0 Universal Public Domain Dedication. |
| The person who associated a work with this deed has dedicated the work to the public domain by waiving all of their rights to the work worldwide under copyright law, including all related and neighboring rights, to the extent allowed by law. You can copy, modify, distribute and perform the work, even for commercial purposes, all without asking permission.
|
