G, an object of class Graph, which has an edge between two vertices if they are incomparable in P
Description
The comparability graph of a poset P is the Graph with vertices given by the ground set of P and which has edges between two vertices if they are incomparable in P.
i1 : incomparabilityGraph booleanLattice 3
o1 = Graph{0 => set {} }
1 => set {2, 4, 6}
2 => set {1, 4, 5}
3 => set {4, 5, 6}
4 => set {1, 2, 3}
5 => set {2, 3, 6}
6 => set {1, 3, 5}
7 => set {}
o1 : Graph
Caveat
This method renames the vertices with integers 0, 1, ... corresponding to the index of the vertices in the GroundSet.