83 search results - page 10 / 17 » combinatorics 2002 |
COMBINATORICS
2002
13 years 7 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...
COMBINATORICS
2002
13 years 7 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...
COMBINATORICS
2002
13 years 7 months ago
2002
We shall prove that for all 3 and > 0 there exists a sparse oriented graph of arbitrarily large order with oriented girth and such that any 1/2 + proportion of its arcs induc...
COMBINATORICS
2002
13 years 7 months ago
2002
A striking result of Bouc gives the decomposition of the representation of the symmetric group on the homology of the matching complex into irreducibles that are self-conjugate. We...
COMBINATORICS
2002
13 years 7 months ago
2002
Fix a rectangular Young diagram R, and consider all the products of Schur functions ssc , where and c run over all (unordered) pairs of partitions which are complementary with re...