Recursive matching algorithms and linear orders on the subset lattice

DOI10.1016/0097-3165(77)90034-6MaRDI QIDQ1239735zbMATH OpenOpenAlexFDO

Authors Dennis White, S. Gill Williamson

Publication date 1977

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0097-3165(77)90034-6

Mathematics Subject Classification ID

Partial orders, general (06A06) Factorials, binomial coefficients, combinatorial functions (05A10) Total orders (06A05) Algorithms in computer science (68W99)

Cites work

• scientific article; zbMATH DE number 3126031 (Why is no real title available?)
• scientific article; zbMATH DE number 3304025 (Why is no real title available?)
• scientific article; zbMATH DE number 3065933 (Why is no real title available?)
• On Dedekind's Problem: The Number of Monotone Boolean Functions
• Strong versions of Sperner's theorem

Cited in

(10)

• On 1-factorizations of bipartite Kneser graphs
• The Schensted Correspondence and Lexicographic Matchings on Multisubset Lattices
• On orthogonal symmetric chain decompositions
• On orthogonal symmetric chain decompositions
• Matchings and the sum function
• Gray codes and symmetric chains
• Footnote to a paper of Griggs, Yeh and Grinstead on partitioning into 4- chains
• Gray codes and symmetric chains
• Unimodality of differences of specialized Schur functions
• On the central levels problem

This page was built for publication: Recursive matching algorithms and linear orders on the subset lattice

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