Lexicographic matching in Boolean algebras

DOI10.1016/0095-8956(73)90001-4zbMATH Open0274.05003OpenAlexW2067460949MaRDI QIDQ2264666FDOQ2264666

Authors: 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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On Rota's problem concerning partitions

Cited In (22)

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

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

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