Involve: A Journal of Mathematics

  • Involve
  • Volume 11, Number 5 (2018), 893-900.

A simple proof characterizing interval orders with interval lengths between 1 and $k$

Simona Boyadzhiyska, Garth Isaak, and Ann N. Trenk

Full-text: Access denied (no subscription detected)

However, an active subscription may be available with MSP at msp.org/involve.

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

Abstract

A poset P=(X,) has an interval representation if each xX can be assigned a real interval Ix so that xy in P if and only if Ix lies completely to the left of Iy. Such orders are called interval orders. Fishburn (1983, 1985) proved that for any positive integer k, an interval order has a representation in which all interval lengths are between 1 and k if and only if the order does not contain (k+2)+1 as an induced poset. In this paper, we give a simple proof of this result using a digraph model.

Article information

Source
Involve, Volume 11, Number 5 (2018), 893-900.

Dates
Received: 31 August 2017
Revised: 30 January 2018
Accepted: 5 February 2018
First available in Project Euclid: 12 April 2018

Permanent link to this document
https://projecteuclid.org/euclid.involve/1523498552

Digital Object Identifier
doi:10.2140/involve.2018.11.893

Mathematical Reviews number (MathSciNet)
MR3784035

Zentralblatt MATH identifier
1385.05057

Subjects
Primary: 05C62: Graph representations (geometric and intersection representations, etc.) For graph drawing, see also 68R10 06A99: None of the above, but in this section

Keywords
interval order interval graph semiorder

Citation

Boyadzhiyska, Simona; Isaak, Garth; Trenk, Ann N. A simple proof characterizing interval orders with interval lengths between 1 and $k$. Involve 11 (2018), no. 5, 893--900. doi:10.2140/involve.2018.11.893. https://projecteuclid.org/euclid.involve/1523498552


Export citation

References

  • S. Boyadzhiyska, G. Isaak, and A. N. Trenk, “Interval orders with two interval lengths”, preprint, 2017.
  • J.-P. Doignon, “Threshold representations of multiple semiorders”, SIAM J. Algebraic Discrete Methods 8:1 (1987), 77–84.
  • J.-P. Doignon, “Sur les représentations minimales des semiordres et des ordres d'intervalles”, Math. Sci. Humaines 101 (1988), 49–59.
  • P. C. Fishburn, “Intransitive indifference with unequal indifference intervals”, J. Mathematical Psychology 7:1 (1970), 144–149.
  • P. C. Fishburn, “Threshold-bounded interval orders and a theory of picycles”, SIAM J. Algebraic Discrete Methods 4:3 (1983), 290–305.
  • P. C. Fishburn, Interval orders and interval graphs: a study of partially ordered sets, John Wiley and Sons, Chichester, 1985.
  • P. C. Fishburn and R. L. Graham, “Classes of interval graphs under expanding length restrictions”, J. Graph Theory 9:4 (1985), 459–472.
  • P. Fishburn and B. Monjardet, “Norbert Wiener on the theory of measurement (1914, 1915, 1921)”, J. Math. Psych. 36:2 (1992), 165–184.
  • M. C. Golumbic and A. N. Trenk, Tolerance graphs, Cambridge Studies in Advanced Mathematics 89, Cambridge University Press, 2004.
  • G. Isaak, “Interval order representations via shortest paths”, pp. 303–311 in The mathematics of preference, choice and order, edited by S. J. Brams et al., Springer, 2009.
  • M. Pirlot and P. Vincke, Semiorders: properties, representations, applications, Theory and Decision Library 36, Kluwer, Dordrecht, 1997.
  • A. Schrijver, Combinatorial optimization: polyhedra and efficiency, Algorithms and Combinatorics 24, Springer, 2003.
  • D. Scott and P. Suppes, “Foundational aspects of theories of measurement”, J. Symb. Logic 23 (1958), 113–128.