Counting chains and antichains in the complete binary tree.

MaRDI QIDQ3428650zbMATH OpenFDO

Authors Jeno Lehel, Michał Morayne, Grzegorz Kubicki

Publication date 29 March 2007

zbMATH Keywords

chains and antichainsenumerationlog-concaveratio inequalitytree poset

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Trees (05C05) Combinatorics of partially ordered sets (06A07)

Recommendations

• Counting embeddings of a chain into a binary tree.
• An asymptotic ratio in the complete binary tree
• Embeddings and other mappings of rooted trees into complete trees
• Counting embeddings of a chain into a tree
• A Ratio Inequality for Binary Trees and the Best Secretary

Cited in

(8)

• An asymptotic ratio in the complete binary tree
• Counting embeddings of rooted trees into families of rooted trees
• Embeddings and other mappings of rooted trees into complete trees
• Counting embeddings of a chain into a tree
• Counting embeddings of a chain into a binary tree.
• Counting mutations and anti-chains in complete binary trees
• A Padé family of iterations for the matrix sign function and related problems.
• The best choice problem for posets; colored complete binary trees

This page was built for publication: Counting chains and antichains in the complete binary tree.

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