## You are here

Homeantichain

## Primary tabs

# antichain

A subset $A$ of a poset $(P,<_{P})$ is an *antichain* if no two elements are comparable. That is, if $a,b\in A$ then $a\nless_{P}b$ and $b\nless_{P}a$.

A *maximal antichain* of $T$ is one which is maximal.

Defines:

antichain, maximal antichain

Related:

TreeSetTheoretic, Aronszajn

Type of Math Object:

Definition

Major Section:

Reference

## Mathematics Subject Classification

05C05*no label found*03E05

*no label found*

- Forums
- Planetary Bugs
- HS/Secondary
- University/Tertiary
- Graduate/Advanced
- Industry/Practice
- Research Topics
- LaTeX help
- Math Comptetitions
- Math History
- Math Humor
- PlanetMath Comments
- PlanetMath System Updates and News
- PlanetMath help
- PlanetMath.ORG
- Strategic Communications Development
- The Math Pub
- Testing messages (ignore)

- Other useful stuff

## Recent Activity

Sep 17

new question: Harshad Number by pspss

Sep 14

new problem: Geometry by parag

Aug 24

new question: Scheduling Algorithm by ncovella

new question: Scheduling Algorithm by ncovella

new question: Harshad Number by pspss

Sep 14

new problem: Geometry by parag

Aug 24

new question: Scheduling Algorithm by ncovella

new question: Scheduling Algorithm by ncovella