Permutation graph
= Permutation graph
The <intersection graph> of the segments in a <permutation diagram>. Two segments cross exactly when their endpoint orders disagree. A set of mutually noncrossing segments corresponds to a monotone subsequence of the endpoint <permutation>.