scientific article; zbMATH DE number 7583268

DOI10.22108/toc.2022.130043.1895MaRDI QIDQ5104004

Valisoa Razanajatovo Misanantenaina, Stephan G. Wagner

Publication date: 9 September 2022

Full work available at URL: https://arxiv.org/abs/1803.09623

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

polynomialsposetsantichainsrooted treescutsets

Mathematics Subject Classification ID

Trees (05C05) Graph polynomials (05C31) Combinatorics of partially ordered sets (06A07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A tree distinguishing polynomial
• Greedy trees, subtrees and antichains
• The \(1/3\)-\(2/3\) conjecture for \(N\)-free ordered sets
• Twelve countings with rooted plane trees
• A new characterization of \(\mathcal{V} \)-posets
• N-free posets as generalizations of series-parallel posets
• Posets in which every cutset meets every fibre
• Order quasisymmetric functions distinguish rooted trees
• Linear extensions of N-free orders.
• Free lamplighter groups and a question of Atiyah
• On the Dual König Property of the Order-interval Hypergraph of Two Classes of N-free Posets
• A Course in Enumeration
• Tutte polynomials for trees
• Transversals in Trees
• Central Limit Theorems for Additive Tree Parameters with Small Toll Functions
• A Contribution to the Theory of Chromatic Polynomials

This page was built for publication: