Interval order
From Wikipedia, the free encyclopedia
In mathematics, especially order theory, the interval order for a collection of intervals on the real line is the partial order corresponding to their left-to-right precedence relation. More formally, a poset is an interval order if and only if there exists a bijection from X to a set of real intervals, so , such that for any we have xi < xj in P exactly when .
The complement of the comparability graph of an interval order (X, ≤) is the interval graph .
[edit] References
Fishburn, Peter (1985). Interval Orders and Interval Graphs: A Study of Partially Ordered Sets. John Wiley.