| Display title | Strong antichain |
| Default sort key | Strong antichain |
| Page length (in bytes) | 2,153 |
| Namespace ID | 0 |
| Page ID | 212882 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>Pchauhan2001 |
| Date of page creation | 05:28, 27 June 2023 |
| Latest editor | imported>Pchauhan2001 |
| Date of latest edit | 05:28, 27 June 2023 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | In order theory, a subset A of a partially ordered set P is a strong downwards antichain if it is an antichain in which no two distinct elements have a common lower bound in P, that is,
$ \forall x,y\in A\;[x\neq y\rightarrow \neg \exists z\in P\;[z\leq x\land z\leq y]]. $
In the case where P is ordered... |
