Current location - Training Enrollment Network - Mathematics courses - Discrete mathematics partial order
Discrete mathematics partial order
If the sorting relation is an integer, then go is equivalent to finding a subset of 2 n- 1

Write the set representation of R, and remove all first.

Discrete relation

(1) element is represented by "circle";

(2) If x≤y, then Y is drawn on the upper layer of X;

(3) if y covers x, connect;

(4) You can draw incomparable elements on the same layer.

For example, draw a Haas diagram of the following relationship.

P={ 1,2,3,4},& ltp,≤& gt; Hastu

A = {2,3,6,12,24,36}, < 1, separable > Hastu.

A={ 1, 2,3,5,6, 10,15,30}, < 1 > Hastu.