An asymptotic ratio in the complete binary tree
From MaRDI portal
Publication:1425163
DOI10.1023/B:ORDE.0000009243.79750.85zbMath1042.06001MaRDI QIDQ1425163
Jenő Lehel, Michał Morayne, Grzegorz M. Kubicki
Publication date: 15 March 2004
Published in: Order (Search for Journal in Brave)
Trees (05C05) Combinatorics of partially ordered sets (06A07) Combinatorial probability (60C05) Combinatorial inequalities (05A20) Asymptotic enumeration (05A16)
Related Items
Embeddings and other mappings of rooted trees into complete trees ⋮ The best choice problem for posets; colored complete binary trees ⋮ Counting embeddings of rooted trees into families of rooted trees ⋮ Enumeration of some classes of pattern avoiding matchings, with a glimpse into the matching pattern poset
This page was built for publication: An asymptotic ratio in the complete binary tree
