Comparability invariance results for tolerance orders

DOI10.1023/A:1012291815365MaRDI QIDQ1611298zbMATH OpenOpenAlexFDO

Authors Kenneth P. Bogart, Joshua D. Laison, Garth Isaak, Ann Trenk

Publication date 21 August 2002

Published in Order (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1012291815365

bitolerance orders bounded tolerance orders comparability graph comparability invariance finite posets parallelogram orders unit tolerance orders

Mathematics Subject Classification ID

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

Review text

Given a class of posets, say *-posets, then it is a comparability invariant if the following theorem holds: If \(P\) and \(Q\) have the same comparability graph then \(P\) is a *-poset iff \(Q\) is a *-poset. A parameter \(\pi\) is a comparability invariant if *\(\Leftrightarrow \pi=n\) is a comparability invariant for all admissible values \(n\) of \(\pi\). In this paper, using differing techniques for the different theorems, *-posets may be bounded tolerance orders, unit bitolerance orders, unit tolerance orders, where each of these finite posets is described in an alternate way (parallelogram orders, point-core bitolerance orders and \(50\%\) tolerance orders respectively) important in providing proofs of comparability invariance in each case.

Recommendations

Cited in

(2)

This page was built for publication: Comparability invariance results for tolerance orders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1611298)