Noncrossing Trees and Noncrossing Graphs
| dc.creator | Chen, William Y. C. | |
| dc.creator | Yan, Sherry H. F. | |
| dc.date | 2005-09-30 | |
| dc.date.accessioned | 2026-07-07T06:19:55Z | |
| dc.date.available | 2026-07-07T06:19:55Z | |
| dc.description | We give a parity reversing involution on noncrossing trees that leads to a combinatorial interpretation of a formula on noncrossing trees and symmetric ternary trees in answer to a problem proposed by Hough. We use the representation of Panholzer and Prodinger for noncrossing trees and find a correspondence between a class of noncrossing trees, called proper oncrossing trees, and the set of symmetric ternary trees. The second result of this paper is a parity reversing involution on connected noncrossing graphs which leads to a relation between the number of noncrossing trees with a given number of edges and descents and the number of connected noncrossing graphs with a given number of vertices and edges. | |
| dc.description | 7 pages, 5 figures | |
| dc.identifier | https://arxiv.org/abs/math/0509715 | |
| dc.identifier | http://arxiv.org/abs/math/0509715 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/95192 | |
| dc.subject | Combinatorics | |
| dc.subject | 05A05, 05C30 | |
| dc.title | Noncrossing Trees and Noncrossing Graphs | |
| dc.type | text |