A Ratio Inequality for Binary Trees and the Best Secretary

DOI10.1017/S0963548301004977zbMath1005.60020MaRDI QIDQ3147276

Michał Morayne, Jenő Lehel, Grzegorz M. Kubicki

Publication date: 21 October 2002

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

zbMATH Keywords

binary treesHasse diagrambest secretary problem

Mathematics Subject Classification ID

Trees (05C05) Combinatorial probability (60C05)

Related Items (4)

Embeddings and other mappings of rooted trees into complete trees ⋮ The best choice problem for posets; colored complete binary trees ⋮ Counting embeddings of a chain into a tree ⋮ Counting embeddings of rooted trees into families of rooted trees

This page was built for publication: A Ratio Inequality for Binary Trees and the Best Secretary