On the Weakness of an Ordered Set

DOI10.1137/S0895480197319628zbMath0905.06001MaRDI QIDQ4210231

Ann N. Trenk, John G. Gimbel

Publication date: 21 September 1998

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

algorithmspartially ordered setsweak ordersforcing cycleranking of elements

Mathematics Subject Classification ID

Partial orders, general (06A06) Graph theory (including graph drawing) in computer science (68R10)

Related Items (10)

The \(t\)-discrepancy of a poset ⋮ On \(k\)-weak orders: Recognition and a tolerance result ⋮ When linear and weak discrepancy are equal ⋮ The fractional weak discrepancy of $(M, 2)$-free posets ⋮ The fractional weak discrepancy of a partially ordered set ⋮ Fractional weak discrepancy and split semiorders ⋮ Forbidden subposets for fractional weak discrepancy at most \(k\) ⋮ Range of the fractional weak discrepancy function ⋮ Fractional weak discrepancy and interval orders ⋮ Tolerance orders of open and closed unit intervals

This page was built for publication: On the Weakness of an Ordered Set