Your favourite instructive papers in combinatorics

Frank Ruskey ruskey at
Thu Mar 11 04:56:17 CET 2004

I think this paper would be perfect for your purposes:
Calkin and Wilf: Recounting the rationals

Frank Ruskey         e-mail: (last_name)(AT)cs(DOT)uvic(DOT)ca
Dept. of Computer Science        fax:    250-721-7292
University of Victoria           office: 250-721-7232
Victoria, B.C. V8W 3P6 CANADA    WWW:

On Tue, 9 Mar 2004, Gordon Royle wrote:

> I'm teaching a small combinatorial algorithms / combinatorial
> enumeration unit this semester, trying to cover a range of topics from
> the classical (generating permutations, partitions etc) through
> elementary Polya-counting, bijective proofs and computational
> techniques like orderly algorithms.
> One thing I want to do is to give each student a paper on which they
> have to prepare a 25-minute talk, so I am trying to choose good,
> instructive, interesting, but not overly technical papers in the entire
> broad area of combinatorial algorithms/enumeration/computing.
> I have my own favourites - Ron Read's paper "Every one a winner" on
> orderly algorithms is one example, but would like to know what other
> gems I should consider....  Expository work such as textbooks or survey
> papers is as welcome as research papers.
> As most combinatorial enumerating and computing ends up with sequences,
> I thought that many seqfans would have their own favourites ...
> Over to you..
> Cheers
> Gordon

More information about the SeqFan mailing list