Line directionality of orders
The authors extend a result given by I. Rival and J. Urrutia proving that any class of ordered sets, closed by the substitution of antichains and whose chromatic number of the diagram is unbounded, contains for any positive integer \(k\) an ordered set which is not \(k\)-directional. As a consequence, \(N\)-free orders, interval orders and two-dimensional orders may require an arbitrary number of directions. They also give a sufficient condition on \(\text{Succ}(P)\) for the line- directionality of \(P\). Using this condition, they establish the line- directionality of \(N\)-free orders and interval orders using at most \(|\text{Succ}(P)|\) directions. In the last section, they state the line-two-directionality of weak orders, tree-like orders and two-dimensional orders of height one.
- A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders
- Bipartite permutation graphs
- Chromatic number of Hasse diagrams, eyebrows and dimension
- Constructing colorings for diagrams
- Drawing orders with few slopes
- Efficient Planarity Testing
- scientific article; zbMATH DE number 3945379 (Why is no real title available?)
- scientific article; zbMATH DE number 6157237 (Why is no real title available?)
- Motion Planning,Two-Directional Point Representation, and Ordered Sets
- On Removing a Ball without Disturbing the Others
- On the directionality of interval orders
- Partial orders of dimension 2
- Planar lattices and planar graphs
- Representing orders on the plane by translating convex figures
- Representing orders on the plane by translating points and lines
This page was built for publication: Line directionality of orders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1311417)
