Asymptotic Methods in Combinatorics

*(Invited Minisymposium)*

4:00 PM-6:00 PM

*Room: Georgia 8*

Asymptotic methods refers to the use of analysis, probability theory, and combinatorics to discover approximate solutions to combinatorial problems whose exact solutions cannot be btained in any meaningful way. Such approximate results facilitate applications and yield theoretical insights. The four speakers in this section have made numerous contributions to this area of research. Their talks will focus on graphical enumeration, sharp concentration results for maps, and connectivity.

**Organizer: E. Rodney Canfield**

*University of Georgia*

**4:00-4:25 On Some Sharp Concentration Results for Random Planar Maps**

- Jason Z. Gao, Carleton University, Ottawa, Canada

**4:30-4:55 Counting Graphs with Degrees Bounded by n/2**

- Brendan McKay, Australian National University, Canberra, Australia

**5:00-5:25 Asymptotics for the Probability of Connectedness and the Distribution of Number of Components**

- E. A. Bender, University of Califonia, San Diego;
*Bruce Richmond*, University of Waterloo, Canada; and P. J. Cameron, Queen Mary and Westfield College, London, United Kingdom

**5:30-5:55 Distribution of the Number of Copies of a Subgraph in a Random Graph**

*Nicholas C. Wormald*, The University of Melbourne, Victoria, Australia; and Dudley Stark, BRIMS, Hewlett Packard Laboratories, Bristol, United Kingdom

*LMH, 1/19/99, MMD, 3/15/99*