Pages that link to "Item:Q3147276"
From MaRDI portal
The following pages link to A Ratio Inequality for Binary Trees and the Best Secretary (Q3147276):
Displaying 7 items.
- Tree-cover ratio of graphs with asymptotic convergence identical to that of the secretary problem (Q482492) (← links)
- An asymptotic ratio in the complete binary tree (Q1425163) (← links)
- Partial-order analogue of the secretary problem: The binary tree case (Q1584204) (← links)
- Counting embeddings of rooted trees into families of rooted trees (Q2088692) (← links)
- Embeddings and other mappings of rooted trees into complete trees (Q2492805) (← links)
- Counting embeddings of a chain into a tree (Q2566143) (← links)
- The best choice problem for posets; colored complete binary trees (Q5963606) (← links)