A new matching property for posets and existence of disjoint chains
| Autor: | Shahriar Shahriari, Mark J. Logan |
|---|---|
| Rok vydání: | 2004 |
| Předmět: |
Geometric lattice
Discrete mathematics Noncrossing partition Integer lattice Disjoint sets Noncrossing partitions Matching property Theoretical Computer Science Combinatorics Graded poset Computational Theory and Mathematics Lattice (order) Convex polytope Discrete Mathematics and Combinatorics Disjoint chains Boolean lattice Partially ordered set Shadow-matching Mathematics |
| Zdroj: | Journal of Combinatorial Theory, Series A. 108(1):77-87 |
| ISSN: | 0097-3165 |
| DOI: | 10.1016/j.jcta.2004.06.002 |
| Popis: | Let P be a graded poset. Assume that x1,…,xm are elements of rank k and y1,…,ym are elements of rank l for some k |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect