Recursive matching algorithms and linear orders on the subset lattice

DOI10.1016/0097-3165(77)90034-6zbMath0362.05011OpenAlexW1981912048MaRDI QIDQ1239735

Dennis E. 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)

Related Items (9)

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

Cites Work

• Strong versions of Sperner's theorem
• On Dedekind's Problem: The Number of Monotone Boolean Functions
• Unnamed Item
• Unnamed Item
• Unnamed Item

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