Cutsets and anti-chains in linear lattices

DOI10.1016/j.jcta.2006.03.022zbMath1103.06001OpenAlexW2066358178MaRDI QIDQ855880

N. E. Zubov

Publication date: 7 December 2006

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.2006.03.022

zbMATH Keywords

cutsetmaximal chainprojective geometryfibrelinear latticeanti-chainPG\((n,q)\)

Mathematics Subject Classification ID

Partial orders, general (06A06) Extremal set theory (05D05) Combinatorial aspects of finite geometries (05B25) General theory of linear incidence geometry and projective geometries (51A05) Total orders (06A05)

Cites Work

• Unnamed Item
• Cutsets of Boolean lattices
• Chains, antichains, and fibres
• A minimal cutset of the Boolean lattice with almost all members
• On uniform \(f\)-vectors of cutsets in the truncated Boolean lattice
• Matchings, cutsets, and chain partitions in graded posets
• Long symmetric chains in the Boolean lattice
• Maximal Chains and Antichains in Boolean Lattices

This page was built for publication: Cutsets and anti-chains in linear lattices