Antichain
In mathematics, in the area of order theory, an antichain is a subset of a partially ordered set such that any two distinct elements in the subset are incomparable. The size of the largest antichain in a partially ordered set is known as its width. By Dilworth's theorem, this also equals the minimum number of chains (totally ordered subsets) into which the set can be partitioned. Dually, the height of the partially ordered set (the length of its longest chain) equals by Mirsky's theorem the minimum number of antichains into which the set can be partitioned.
Wikipage disambiguates
Wikipage redirect
1/3–2/3 conjectureAbstract simplicial complexAnti-chainAxiom of choiceCardinal functionCoterieDedekind numberDedekind–MacNeille completionDickson's lemmaDilworth's theoremEmanuel SpernerErdős–Dushnik–Miller theoremErdős–Szekeres theoremExtremal Problems For Finite SetsFence (mathematics)Forcing (mathematics)G. W. PeckGlossary of graph theoryGlossary of order theoryGlossary of set theoryGraph homomorphismIncidence posetIndex of combinatorics articlesLattice of stable matchingsLeon MirskyList of factorial and binomial topicsList of mathematical jargonList of order theory topicsList of terms relating to algorithms and data structuresMaximal and minimal elementsMirsky's theoremOrder polynomialOrder theoryOrdinal optimizationPartially ordered setPerfect graphPerfect graph theoremPermutation patternPoset heightPoset width
Link from a Wikipage to another Wikipage
primaryTopic
Antichain
In mathematics, in the area of order theory, an antichain is a subset of a partially ordered set such that any two distinct elements in the subset are incomparable. The size of the largest antichain in a partially ordered set is known as its width. By Dilworth's theorem, this also equals the minimum number of chains (totally ordered subsets) into which the set can be partitioned. Dually, the height of the partially ordered set (the length of its longest chain) equals by Mirsky's theorem the minimum number of antichains into which the set can be partitioned.
has abstract
Antyłańcuch to termin w kilku ...... anych z pewnymi praporządkami.
@pl
Em matemática, na área da teor ...... ner na literatura mais antiga.
@pt
En matemáticas, una anticadena ...... comparables.
* Datos: Q431937
@es
En mathématiques, plus précisé ...... cardinaux de ses antichaînes.
@fr
In mathematics, in the area of ...... ly ordered set is #P-complete.
@en
Protiřetězec (někdy také označ ...... ájemně neporovnatelných prvků.
@cs
Антицепь — подмножество частич ...... доченного множества является .
@ru
У математиці, в області теорії ...... парно непорівнянних елементів.
@uk
在序理論中，设A是一个偏序集，B为A的一个子集，若B中任意两 ...... 表述就是： 设是一个偏序集，是的子集，则B是A上的反链等价于
@zh
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,025,091,148
Link from a Wikipage to another Wikipage
title
Antichain
@en
urlname
Antichain
@en
wikiPageUsesTemplate
subject
hypernym
comment
Antyłańcuch to termin w kilku ...... anych z pewnymi praporządkami.
@pl
Em matemática, na área da teor ...... ner na literatura mais antiga.
@pt
En matemáticas, una anticadena ...... unto G de A:
* Datos: Q431937
@es
En mathématiques, plus précisé ...... cardinaux de ses antichaînes.
@fr
In mathematics, in the area of ...... ch the set can be partitioned.
@en
Protiřetězec (někdy také označ ...... ájemně neporovnatelných prvků.
@cs
Антицепь — подмножество частич ...... множество может быть разбито.
@ru
У математиці, в області теорії ...... парно непорівнянних елементів.
@uk
在序理論中，设A是一个偏序集，B为A的一个子集，若B中任意两 ...... 表述就是： 设是一个偏序集，是的子集，则B是A上的反链等价于
@zh
label
Anticadeia
@pt
Anticadena
@es
Antichain
@en
Antichaîne
@fr
Antikette
@de
Antyłańcuch
@pl
Protiřetězec
@cs
Антиланцюг
@uk
Антицепь
@ru
反链
@zh