交大113 線性代數與離散數學第4c題｜離散數學 Ch10 偏序集、格、布林代數與命題邏輯

離散數學›Ch10 偏序集、格、布林代數與命題邏輯

第 7 題／共 18 題

7. 偏序集、二元關係

#LS-10-007易偏序集二元關係

c. (4 points) Consider the same graph as above: a grid of unit squares spanning 6 columns and 4 rows (lattice points from $(0,0)$ to $(6,4)$ ), with vertex $m$ at $(0,0)$ and vertex $n$ at $(6,4)$ . Let $P$ be the set of all vertices in this graph. Define a binary relation $R$ on $P$ such that $(p,q) \in R$ if we need either one unit to the right or one unit upward to move from vertices $p$ to $q$ . Is $(P,R)$ a partially ordered set? Why or why not?

📄 交大113

▤完整推導請見《WH 資工筆記 · 離散數學》Ch10 偏序集、格、布林代數與命題邏輯

本章題號 · 1–18 / 18