Add to ORKGDilworth's theorem establishes a link between a minimal path cover and a maximal antichain in a digraph.A new proof for Dilworth's theorem is given. Moreover an algorithm to find both the path cover and the antichain, as considered in the theorem, is presented.
AbstractA common generalization of the theorems of Greene and Greene and Kleitman is presented. This...
AbstractWe present a structural characterization of the class of acyclic diagraphs which have the Ga...
AbstractAharoni and Korman (Order 9 (1992) 245) have conjectured that every ordered set without infi...
textabstractDilworth's theorem establishes a link between a minimal path cover and a maximal antic...
AbstractWe prove a range of minmax theorems about cycle packing and covering in digraphs whose verti...
AbstractIn this paper we present a constructive proof of a theorem on minimal decompositions of part...
AbstractDilworth's famous theorem [1] states that if the maximal sized antichains of a finite poset ...
International audienceWe prove a range of minmax theorems about cycle packing and covering in digrap...
AbstractThe celebrated Dilworth theorem (Ann. of Math. 51 (1950), 161–166) on the decomposition of f...
AbstractRecently there has been a good deal of interest in the maximal sized antichains of a partial...
AbstractIn this paper we solve the following problem: Given an integer m, construct a digraph with e...
Let P be a nite partially ordered set. Dilworth's theorem states that the maximal size of an an...
Abstract. We provide a new proof of a theorem of Saks which is an extension of Greene's Theorem...
A digraph obtained by replacing each edge of a complete multipartite graph by an arc or a pair of mu...
AbstractWe give upper bounds for the Dilworth number of a graph. These bounds are formulated in term...
AbstractA common generalization of the theorems of Greene and Greene and Kleitman is presented. This...
AbstractWe present a structural characterization of the class of acyclic diagraphs which have the Ga...
AbstractAharoni and Korman (Order 9 (1992) 245) have conjectured that every ordered set without infi...
textabstractDilworth's theorem establishes a link between a minimal path cover and a maximal antic...
AbstractWe prove a range of minmax theorems about cycle packing and covering in digraphs whose verti...
AbstractIn this paper we present a constructive proof of a theorem on minimal decompositions of part...
AbstractDilworth's famous theorem [1] states that if the maximal sized antichains of a finite poset ...
International audienceWe prove a range of minmax theorems about cycle packing and covering in digrap...
AbstractThe celebrated Dilworth theorem (Ann. of Math. 51 (1950), 161–166) on the decomposition of f...
AbstractRecently there has been a good deal of interest in the maximal sized antichains of a partial...
AbstractIn this paper we solve the following problem: Given an integer m, construct a digraph with e...
Let P be a nite partially ordered set. Dilworth's theorem states that the maximal size of an an...
Abstract. We provide a new proof of a theorem of Saks which is an extension of Greene's Theorem...
A digraph obtained by replacing each edge of a complete multipartite graph by an arc or a pair of mu...
AbstractWe give upper bounds for the Dilworth number of a graph. These bounds are formulated in term...
AbstractA common generalization of the theorems of Greene and Greene and Kleitman is presented. This...
AbstractWe present a structural characterization of the class of acyclic diagraphs which have the Ga...
AbstractAharoni and Korman (Order 9 (1992) 245) have conjectured that every ordered set without infi...