ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (210 K)

Article Toolbox
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.jcta.2004.04.001    
How to Cite or Link Using DOI (Opens New Window)

Copyright © 2004 Elsevier Inc. All rights reserved.

Asymptotics of combinatorial structures with large smallest component

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Edward A. BenderE-mail The Corresponding Author, a, Atefeh MashatanE-mail The Corresponding Author, b, Daniel PanarioE-mail The Corresponding Author, c and L. Bruce RichmondE-mail The Corresponding Author, b

a Department of Mathematics, University of California, San Diego, La Jolla 92093, USA

b Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Canada N2L 3G1

c School of Mathematics and Statistics, Carleton University, Ottawa, Canada K1S 5B6


Received 5 May 2003. 
Available online 18 May 2004.

Abstract

We study the probability of connectedness for structures of size n when all components must have size at least m. In the border between almost certain connectedness and almost certain disconnectedness, we encounter a generalized Buchstab function of n/m.

Author Keywords: Combinatorial enumeration; Components; Connectedness

Article Outline

• References

 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.