A new matching property for posets and existence of disjoint chains

DOI10.1016/j.jcta.2004.06.002zbMath1062.06003OpenAlexW1993563145MaRDI QIDQ1881683

Mark J. Logan, Shahriar Shahriari

Publication date: 14 October 2004

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

Full work available at URL: https://doi.org/10.1016/j.jcta.2004.06.002

zbMATH Keywords

disjoint chainsgeometric latticenoncrossing partitionsmatching property

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Semimodular lattices, geometric lattices (06C10) Transversal (matching) theory (05D15)

Related Items (5)

A new relationship between block designs ⋮ Sorting with forbidden intermediates ⋮ Perfect matchings in antipodally colored lattice of subsets ⋮ Unnamed Item ⋮ Methods for nesting rank 3 normalized matching rank-unimodal posets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On chains and Sperner k-families in ranked posets
• On the structure of the lattice of noncrossing partitions
• Matchings, cutsets, and chain partitions in graded posets
• Noncrossing partitions
• Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
• Combinatorial theory.
• Lectures on Polytopes
• A rank inequality for finite geometric lattices
• Maximal Families of Pairwise Disjoint Maximal Proper Chains in a Geometric Lattice
• On disjoint chains of subsets

This page was built for publication: A new matching property for posets and existence of disjoint chains