Revision history [back]

hasse diagram of a subset of a poset

E = {1,2,3} P = SetPartitions(E) This gives the set of all partitions of E,. I have a subset Q of P and I want to construct the directed graph whose vertex set is this set Q and we draw an arrow from p to q in this graph if q covers p. How to construct this graph for a given P and Q?

The definition of covering relation can be found here : https://en.wikipedia.org/wiki/Covering_relation

 2 retagged FrédéricC 2226 ●3 ●25 ●44

hasse diagram of a subset of a poset

E = {1,2,3} P = SetPartitions(E) This gives the set of all partitions of E,. I have a subset Q of P and I want to construct the directed graph whose vertex set is this set Q and we draw an arrow from p to q in this graph if q covers p. How to construct this graph for a given P and Q?

The definition of covering relation can be found here : https://en.wikipedia.org/wiki/Covering_relation

 3 retagged FrédéricC 2226 ●3 ●25 ●44

hasse diagram of a subset of a poset

E = {1,2,3} P = SetPartitions(E) This gives the set of all partitions of E,. I have a subset Q of P and I want to construct the directed graph whose vertex set is this set Q and we draw an arrow from p to q in this graph if q covers p. How to construct this graph for a given P and Q?

The definition of covering relation can be found here : https://en.wikipedia.org/wiki/Covering_relation