Counting embeddings of a chain into a binary tree.

MaRDI QIDQ3011708zbMATH OpenFDO

Authors Małgorzata Kuchta, Michał Morayne, Jarosław Niemiec

Publication date 29 June 2011

zbMATH Keywords

best choicebinary treechain

Mathematics Subject Classification ID

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

Recommendations

• Counting embeddings of a chain into a tree
• Counting chains and antichains in the complete binary tree.
• Binary Trees and (Maximal) Order Types
• Embeddings and other mappings of rooted trees into complete trees
• An asymptotic ratio in the complete binary tree

Cited in

(4)

• Counting embeddings of rooted trees into families of rooted trees
• Counting embeddings of a chain into a tree
• Counting chains and antichains in the complete binary tree.
• The best choice problem for posets; colored complete binary trees

This page was built for publication: Counting embeddings of a chain into a binary tree.

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