The problems of sorting, searching, and scheduling encountered, for instance, in computer science and operations research frequently involve the determination of the width of some ordered set; that is, the maximum size of its antichains. Two illustrations of this general observation are given (Example 4.28 and Exercise 4.2). Thus, this chapter is devoted to the study of the width and to some related topics. First, Dilworth's Theorem states that, in any ordered set P, the minimum number of chains in a chain partition of P is equal to its width. This is one of the most famous results in the field of combinatorics, and the subject of the first two following sections. The theorem is stated and proved in Section 4.1, together with its close relatives. Section 4.2 is devoted to its consequences in the special case of bipartite ordered sets and points out its equivalence to König–Egerváry's Theorem on matchings and transversals in such a structure. In Section 4.5 the importance of this equivalence is emphasized. Especially it leads to an algorithmic determination of the width, by means of results on flows in graph theory. It is moreover recalled that Dilworth's Theorem is also equivalent to three fundamental results of combinatorics, namely the König–Hall, Menger, and Ford and Fulkerson theorems. These results are quite essential and have many practical applications, for instance on binary matrices or allocation problems for the first one (Exercise 4.6) and on transportation networks for the other two.