Perfect matchings in antipodally colored lattice of subsets

DOI10.1016/j.disc.2012.04.002zbMath1252.05173OpenAlexW2015004647MaRDI QIDQ1761465

Michał Dębski

Publication date: 15 November 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2012.04.002

zbMATH Keywords

Boolean latticeperfect matchingantipodal coloring

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Lattices (06B99)

Cites Work

• Maximal independent sets in bipartite graphs obtained from Boolean lattices
• Explicit matchings in the middle levels of the Boolean lattice
• A new matching property for posets and existence of disjoint chains
• Unnamed Item

This page was built for publication: Perfect matchings in antipodally colored lattice of subsets