
AbstractUsing linear programming we prove a generalization of Greene and Kleitman's generalization of Dilworth's theorem on the decomposition of a partially ordered set into chains.
Combinatorial aspects of partitions of integers, Partial orders, general, Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Theoretical Computer Science
Combinatorial aspects of partitions of integers, Partial orders, general, Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Theoretical Computer Science
| citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 32 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
