Stack-sorting preimages and 0-1-trees

DOI10.46298/DMTCS.16393MaRDI QIDQ7294145zbMATH OpenFDO

Authors Miklós Bóna

Publication date 10 July 2026

Published in Discrete Mathematics and Theoretical Computer Science. DMTCS (Search for Journal in Brave)

Full work available at URL https://doi.org/10.46298/DMTCS.16393

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites work

• Combinatorics of permutations
• Enumeration of Stack-Sorting Preimages via a Decomposition Lemma
• Fertility, Strong Fertility, and Postorder Wilf Equivalence
• Permutation classes
• Stack-sorting preimages of permutation classes

Cited in

(1)

• Boolean-Narayana numbers

This page was built for publication: Stack-sorting preimages and 0-1-trees

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