I have only listed sites that have a number of free downloads available or are otherwise of interest.

**Graph Theory White Pages**is a site for looking up graph theorists. http://www.graphtheory.com/resources.htm

**The Electronic Journal of Combinatorics**is one of a growing number of free electronic journals. It was founded by Herb Wilf.

On its web page, there are links to other free mathematics journals on the web.

http://www.combinatorics.org/

**Philippe Flajolet**is at INRIA. He works mainly in combinatorial asymptotics. Drafts of chapters of his forthcoming book with Sedgewick,, can be downloaded as INRIA reports. Many other reprints are available. Material may be formatted for A4 paper and the top line or so may be lost when printed out on 8.5 by 11 paper.*Analytic Combinatorics*

http://algo.inria.fr/flajolet/**Alan Frieze**is at Carnegie Mellon. He works in probabilistic combinatorics. A list of publications and some preprints are available.

http://www.math.cmu.edu/~af1p/index.html**Zhicheng Gao**is at Carleton U. He works in graph theory, especially asymptotics of maps. Preprints and bibliography are available.

http://mathstat.math.carleton.ca/~zgao/**Brendan McKay**is at ANU (Australian National University). He works mainly in algorithmic and asymptotic aspects of graph theory. A complete list of publications and some papers are available.

http://cs.anu.edu.au/~bdm/**Andrew Odlyzko**is at U.Minn. He works primarily in asymtotic enumeration. Many reprints and his extensive chapter, "asymptotic enumeration methods", from the, are available.*Handbook of Combinatorics*

http://www.dtc.umn.edu/~odlyzko

**Joel Spencer**is at the Courant Institute. He works in various areas of combinatorics, usually using probabilistic arguments to obtain asymptotic or existence results. In addition to some papers, you can download his Ohio State Lectures (1993) which deal primarily with random graphs and probabilistic arguments about them.

http://cs.nyu.edu/cs/faculty/spencer/**Herb Wilf**is at U. Penn. He works primarily in enumeration and many of his papers are "pretty." Four of his books and many of his reprints are available.

http://www.cis.upenn.edu/~wilf/**Nick Wormald**is at U. Melbourne. He works primarily in combinatorial asymptotics. Preprints and recent papers are available.

http://www.ms.unimelb.edu.au/~nick/papers.html