1215 search results - page 87 / 243 » Combinatorics |
118
click to vote
COMBINATORICS
2002
15 years 3 months ago
2002
If we compose sufficiently many random functions on a finite set, then the composite function will be constant. We determine the number of compositions that are needed, on average...
130
click to vote
COMBINATORICS
2002
15 years 3 months ago
2002
Let S be a subset of the units in Zn. Let be a circulant graph of order n (a Cayley graph of Zn) such that if ij E(), then i - j (mod n) S. Toida conjectured that if is another...
137
Voted
COMBINATORICS
2002
15 years 3 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...
110
click to vote
COMBINATORICS
2002
15 years 3 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...
137
Voted
COMBINATORICS
2002
15 years 3 months ago
2002
We present a simple heuristic for finding a small connected dominating set of cubic graphs. The average-case performance of this heuristic, which is a randomised greedy algorithm,...