1215 search results - page 89 / 243 » Combinatorics |
173
click to vote
COMBINATORICS
2002
15 years 3 months ago
2002
Erdos, Rubin, and Taylor found a nice correspondence between the minimum order of a complete bipartite graph that is not r-choosable and the minimum number of edges in an r-unifor...
114
Voted
COMBINATORICS
2002
15 years 3 months ago
2002
Let A3(n, d, w) denote the maximum cardinality of a ternary code with length n, minimum distance d, and constant Hamming weight w. Methods for proving upper and lower bounds on A3...
128
Voted
COMBINATORICS
2002
15 years 3 months ago
2002
We prove that the space of possible final configurations for a parking problem is parameterized by the vertices of a regular Bruhat graph associated to a 231-avoiding permutation,...
130
Voted
COMBINATORICS
1998
15 years 3 months ago
1998
It is shown that there are 2n n − n−1 m=0 2n−m−1 2m m permutations which are the union of an increasing sequence and a decreasing sequence. 1991 Mathematics Subject Classi...
COMBINATORICS
1998
15 years 3 months ago
1998
The determinant that is present in traditional formulations of multivariate Lagrange inversion causes difficulties when one attempts to obtain asymptotic information. We obtain an...