The jump number and the lattice of maximal antichains

DOI10.1016/0012-365X(91)90016-UzbMath0731.06003OpenAlexW2082567911MaRDI QIDQ807648

Klaus Reuter

Publication date: 1991

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

Full work available at URL: https://doi.org/10.1016/0012-365x(91)90016-u

zbMATH Keywords

jump numberlength of the lattice of maximal antichains

Mathematics Subject Classification ID

Partial orders, general (06A06) Combinatorics of partially ordered sets (06A07)

Related Items

Computational aspects of the 2-dimension of partially ordered sets, Computing on-line the lattice of maximal antichains of posets, On-line algorithms for orders, On the number of maximal antichains in Boolean lattices for \(n\) up to 7, The presence of lattice theory in discrete problems of mathematical social sciences. Why., Tackling the jump number of interval orders, \(N\)-free orders and minimal interval extensions, Simplicial elimination schemes, extremal lattices and maximal antichain lattices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Jump number problem: The role of matroids
• Interval orders without odd crowns are defect optimal
• Setup optimization problems with matroid structure
• S-verklebte Summen von Verbänden
• Minimizing Setups for Ordered Sets: A Linear Algebraic Approach
• Optimal Linear Extensions by Interchanging Chains
• Algorithmic Approaches to Setup Minimization
• The Jump Number of Dags and Posets: An Introduction