Publication:3010525

DOI10.4000/MSH.11716zbMATH Open1245.06002OpenAlexW53473754MaRDI QIDQ3010525FDOQ3010525

Nathalie Caspard

Publication date: 4 July 2011

Published in: Mathématiques et sciences humaines (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4000/msh.11716

zbMATH Keywords

partially ordered setantichainchainCoxeter latticeSperner width

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07)

Cited In (9)

• The minimum of the antichains in the factor poset
• Antichains, the stick principle, and a matching number
• Covering a symmetric poset by symmetric chains
• Counting proper mergings of chains and antichains
• A chain complete poset with no infinite antichain has a finite core
• Indicators, chains, antichains, Ramsey property
• Antichains in weight posets associated with gradings of simple Lie algebras
• Antichains and Finite Sets that Meet all Maximal Chains
• Families of chains of a poset and Sperner properties

Recommendations

• Title not available (Why is that?) 👍 👎
• From finite posets to chain complete posets having no infinite antichain 👍 👎
• Posets with the maximal antichain property 👍 👎
• Antichains and Finite Sets that Meet all Maximal Chains 👍 👎
• Investigating posets via their maximal chains 👍 👎
• Finite antichain cutsets in posets 👍 👎
• A characterisation of posets that are nearly antichains 👍 👎
• Chains and antichains in partial orderings 👍 👎
• Maximum-sized antichains in minimal posets 👍 👎
• The number of antichains in ranked posets 👍 👎

This page was built for publication: Des chaînes et des antichaînes dans les ensembles ordonnés finis

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