Lexicographic matching in Boolean algebras

DOI10.1016/0095-8956(73)90001-4zbMath0274.05003OpenAlexW2067460949MaRDI QIDQ2264666

Martin Aigner

Publication date: 1973

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

Full work available at URL: https://doi.org/10.1016/0095-8956(73)90001-4

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Related Items (20)

The Schensted Correspondence and Lexicographic Matchings on Multisubset Lattices ⋮ Lexicographic matchings cannot form Hamiltonian cycles ⋮ Unimodality of differences of specialized Schur functions ⋮ Some approaches for solving the general (\(t,k\))-design existence problem and other related problems ⋮ A local injective proof of log-concavity for increasing spanning forests ⋮ Unnamed Item ⋮ On the central levels problem ⋮ Construction of 2-factors in the middle layer of the discrete cube ⋮ The Stanley Depth in the Upper Half of the Koszul Complex ⋮ Symmetrische Zerlegung von Kettenprodukten ⋮ Parenthesizations of finite distributive lattices ⋮ On 1-factorizations of bipartite Kneser graphs ⋮ Greedy matching in Young's lattice ⋮ Extremal problems for sets forming Boolean algebras and complete partite hypergraphs ⋮ Gray codes and symmetric chains ⋮ Boolean layer cakes ⋮ On orthogonal symmetric chain decompositions ⋮ Footnote to a paper of Griggs, Yeh and Grinstead on partitioning into 4- chains ⋮ The antipodal layers problem ⋮ Gröbner bases for complete uniform families

Cites Work

• On Rota's problem concerning partitions
• Unnamed Item
• Unnamed Item

This page was built for publication: Lexicographic matching in Boolean algebras