A Ratio Inequality for Binary Trees and the Best Secretary

DOI10.1017/S0963548301004977zbMATH Open1005.60020MaRDI QIDQ3147276FDOQ3147276

Authors: Jeno Lehel, Michał Morayne, Grzegorz Kubicki 

Publication date: 21 October 2002

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

Recommendations

• An asymptotic ratio in the complete binary tree
• Partial-order analogue of the secretary problem: The binary tree case
• Tree-cover ratio of graphs with asymptotic convergence identical to that of the secretary problem
• Some extremal ratios of the distance and subtree problems in binary trees
• The optimal distribution of a tree in a finite set
• Characteristic inequalities for binary trees
• scientific article
• scientific article; zbMATH DE number 3995070
• Ratios of some domination parameters in trees

zbMATH Keywords

binary treesHasse diagrambest secretary problem

Mathematics Subject Classification ID

Trees (05C05) Combinatorial probability (60C05)

Cited In (8)

• Counting embeddings of a chain into a tree
• An asymptotic ratio in the complete binary tree
• The best choice problem for posets; colored complete binary trees
• Tree-cover ratio of graphs with asymptotic convergence identical to that of the secretary problem
• Embeddings and other mappings of rooted trees into complete trees
• Partial-order analogue of the secretary problem: The binary tree case
• Counting chains and antichains in the complete binary 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3147276)