Exact, approximate, asymptotic, and computational formulas are derived for the expected number of components of any given size in a random linear graph. A theorem generalizes some asymptotic results of Austin, Fagen, Penney, and Riordan.
"The Expected Number of Components in Random Linear Graphs." Ann. Probab. 1 (5) 876 - 881, October, 1973. https://doi.org/10.1214/aop/1176996856