Embeddings and other mappings of rooted trees into complete trees

DOI10.1007/S11083-005-9020-YzbMath1090.06003OpenAlexW2003280412MaRDI QIDQ2492805

Nicholas Georgiou

Publication date: 14 June 2006

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11083-005-9020-y

Mathematics Subject Classification ID

Trees (05C05) Combinatorics of partially ordered sets (06A07)

Related Items (2)

The best choice problem for posets; colored complete binary trees ⋮ Counting embeddings of rooted trees into families of rooted trees

Cites Work

• An asymptotic ratio in the complete binary tree
• Partial-order analogue of the secretary problem: The binary tree case
• A Ratio Inequality for Binary Trees and the Best Secretary
• Unnamed Item
• Unnamed Item

This page was built for publication: Embeddings and other mappings of rooted trees into complete trees