Reinterpreting the Middle-Levels Theorem via Natural Enumeration of Ordered Trees

2019/11/05 by Dejter, Italo J.
#05C15 #05C45 #05C62 #05C70 #06A05 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1911.02100

Abstract

Let 0

Related

• A generating tree with a single label for permutations avoiding the vincular pattern 1-32-4
• Induced betweenness in order-theoretic trees
• Note on islands in path-length sequences of binary trees
• Grand Motzkin paths and \0,1,2\-trees -- a simple bijection
• A One-to-One Correspondence between Natural Numbers and Binary Trees