Some sequences associated with combinatorial structures (Q1073032): Difference between revisions

This is an interesting survey article with a number of new results. The author studies properties of integer sequences associated with hypergraphs (the rank sequence, the stability sequence, the covering norm sequence, the partition rank sequence) which establish a general framework for the formulation and proof of duality results in combinatorial structures. It is well known that Green and Kleitman generalized classical Dilworth's decomposition theorem for posets. In the paper under review, a generalization of these results to acyclic digraphs is proved and applied to prove the acyclic case of a conjecture of Berge. An analog of Greene's theorem is proved for matchings of a bipartite graph. The paper ends with a rich bibliography.