72 search results - page 9 / 15 » combinatorics 1999 |
96
Voted
COCOON
1999
Springer
15 years 2 months ago
1999
Springer
El-Yaniv et al. presented an optimal on-line algorithm for the unidirectional currency conversion problem based on the threat-based strategy. Later, al-Binali pointed out that this...
COMBINATORICS
1999
14 years 9 months ago
1999
Abstract. Consider, for a permutation Sk, the number F(n, ) of permutations in Sn which avoid as a subpattern. The conjecture of Stanley and Wilf is that for every there is a c...
COMBINATORICS
1999
14 years 9 months ago
1999
Abstract. We generalize Ehrhart's idea ([Eh]) of counting lattice points in dilated rational polytopes: Given a rational simplex, that is, an n-dimensional polytope with n + 1...
72
Voted
COMBINATORICS
1999
14 years 9 months ago
1999
It is proven that for every fixed h, a and b, a graph with n vertices and minimum degree at least h-1 h n, which contains no copy of Kb (the complete graph with b vertices), conta...
COMBINATORICS
1999
14 years 9 months ago
1999
A symmetric group action on the maximal chains in a finite, ranked poset is local if the adjacent transpositions act in such a way that (i, i + 1) sends each maximal chain either ...