Traces of antichains
β Scribed by P. Frankl
- Publisher
- Springer Japan
- Year
- 1989
- Tongue
- English
- Weight
- 227 KB
- Volume
- 5
- Category
- Article
- ISSN
- 0911-0119
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A subset A of an ordered set P is a cutset if each maximal chain of P meetsA ; if, in addition, A is an antichain call it an antichain cutset. Our principal result is a characterization, by means of a 'forbidden configuration', of those finite ordered sets, which can be expressed as the union of ant
Robertson and Seymour have shown that there is no infinite set of graphs in which no member is a minor of another. By contrast, it is well known that the class of all matroids does contains such infinite antichains. However, for many classes of matroids, even the class of binary matroids, it is not