Greedy Ordered Sets With No Four-Cycles

We characterize “effectively” all greedy ordered sets, relative to the jump number problem, which contain no four-cycles. As a consequence, we shall prove that \(O(P) = G(P)\) \quad whenever \(P \text{ greedy ordered set with no four-cycles.}\)