Foata's Bijection for Tree-Like Structures

Simple item page
dc.creatorPikhurko, Oleg
dc.date2000-07-25
dc.date.accessioned2026-07-07T04:36:29Z
dc.date.available2026-07-07T04:36:29Z
dc.descriptionWe present bijections enumerating (k,m)-trees, k-gon trees, edge labelled (2,1)-trees, and other tree-like structures. Our constructions are based on Foata's (1971) bijection for cycle-free functions, which is simplified here.
dc.description8 pages
dc.identifierhttps://arxiv.org/abs/math/0007148
dc.identifierhttp://arxiv.org/abs/math/0007148
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/59616
dc.subjectCombinatorics
dc.subject05A15
dc.titleFoata's Bijection for Tree-Like Structures
dc.typetext

Files

Collections

arXiv