Join Our Newsletter

COMBINATORICS

2002

9 years 10 months ago
2002

We investigate the numbers dk of all (isomorphism classes of) distributive lattices with k elements, or, equivalently, of (unlabeled) posets with k antichains. Closely related and...

COMBINATORICS

2002

9 years 10 months ago
2002

Several authors have examined connections between permutations which avoid 132, continued fractions, and Chebyshev polynomials of the second kind. In this paper we prove analogues...

COMBINATORICS

2002

9 years 10 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,...

COMBINATORICS

2002

9 years 10 months ago
2002

COMBINATORICS

2002

9 years 10 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

9 years 10 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

9 years 10 months ago
2002

COMBINATORICS

2002

9 years 10 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...

COMBINATORICS

2002

9 years 10 months ago
2002

Inspired by the results of Baik, Deift and Johansson on the limiting distribution of the lengths of the longest increasing subsequences in random permutations, we find those limit...

COMBINATORICS

2002

9 years 10 months ago
2002