Some methods for computing component distribution probabilities in relational structures
- 31 August 1987
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 66 (1-2) , 59-77
- https://doi.org/10.1016/0012-365x(87)90119-1
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- A logical approach to asymptotic combinatorics II: Monadic second-order propertiesJournal of Combinatorial Theory, Series A, 1989
- A logical approach to asymptotic combinatorics I. First order propertiesAdvances in Mathematics, 1987
- Counting interval graphsTransactions of the American Mathematical Society, 1982
- On the number of trees in a random forestJournal of Combinatorial Theory, Series B, 1979
- Asymptotic Methods in EnumerationSIAM Review, 1974
- A Relationship between Two Sequences IiiJournal of the London Mathematical Society, 1968
- Ordered cycle lengths in a random permutationTransactions of the American Mathematical Society, 1966
- A Generalisation of Stirling's Formula.Journal für die reine und angewandte Mathematik (Crelles Journal), 1956
- Probability of Indecomposability of a Random Mapping FunctionThe Annals of Mathematical Statistics, 1955
- The Expected Number of Components Under a Random Mapping FunctionThe American Mathematical Monthly, 1954