Asymptotics of Largest Components in Combinatorial Structures

Authors

Mohamed Omar, Harvey Mudd CollegeFollow
Daniel Panario, Carleton University
Bruce Richmond, University of Waterloo
Jacki Whitely

Document Type

Article

Department

Mathematics (HMC)

Publication Date

2006

Abstract

Given integers m and n, we study the probability that structures of size n have all components of size at most m. The results are given in term of a generalized Dickman function of n/m.

Rights Information

© 2006 Mohamed Omar, Daniel Panario, Bruce Richmond, Jacki Whitely

DOI

10.1007/s00453-006-0103-y

Recommended Citation

Omar, M., Panario, D., Richmond, B., and Whitely, J. Asymptotics of Largest Components in Combinatorial Structures. Algorithmica. Vol. 46, Issue: 3-4. pp.493-503 (2006). DOI: 10.1007/s00453-006-0103-y