A simple proof characterizing interval orders with interval lengths between 1 and \(k\)

DOI10.2140/involve.2018.11.893zbMath1385.05057arXiv1709.00313OpenAlexW3099587140WikidataQ130016470 ScholiaQ130016470MaRDI QIDQ1747276

Simona Boyadzhiyska, Garth Isaak, Ann N. Trenk

Publication date: 4 May 2018

Published in: Involve (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1709.00313

zbMATH Keywords

interval ordersemiorderinterval graph

Mathematics Subject Classification ID

Partial orders, general (06A06) Permutations, words, matrices (05A05) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (2)

Dimension of restricted classes of interval orders ⋮ Interval orders with two interval lengths

Cites Work

• Unnamed Item
• Norbert Wiener on the theory of measurement (1914, 1915, 1921)
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Intransitive indifference with unequal indifference intervals
• Foundational aspects of theories of measurement
• Threshold-Bounded Interval Orders and a Theory of Picycles
• Threshold Representations of Multiple Semiorders
• Classes of interval graphs under expanding length restrictions

This page was built for publication: A simple proof characterizing interval orders with interval lengths between 1 and \(k\)