Abstract
A poset P=(X,≺) has an interval representation if each x∈X can be assigned a real interval Ix so that x≺y in P if and only if Ix lies completely to the left of Iy. Such orders are called interval orders. In this paper we give a surprisingly simple forbidden poset characterization of those posets that have an interval representation in which each interval length is either 0 or 1. In addition, for posets (X,≺) with a weight of 1 or 2 assigned to each point, we characterize those that have an interval representation in which for each x∈X the length of the interval assigned to x equals the weight assigned to x. For both problems we can determine in polynomial time whether the desired interval representation is possible and in the affirmative case, produce such a representation.
Original language | English |
---|---|
Pages (from-to) | 52-63 |
Number of pages | 12 |
Journal | Discrete Applied Mathematics |
Volume | 267 |
DOIs | |
Publication status | Published - 31 Aug 2019 |
Bibliographical note
Funding Information:This work was supported by a Jerome A. Schiff Fellowship at Wellesley College, United States.This work was supported by a grant from the Simons Foundation, United States (#426725, Ann Trenk).
Publisher Copyright:
© 2019 Elsevier B.V.
Keywords
- Interval graph
- Interval order
- Semiorder
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Applied Mathematics