Asymptotic enumeration and a 0-1 law for $m$-clique free graphs
HTML articles powered by AMS MathViewer
- by Ph. G. Kolaitis, H.-J. Prömel and B. L. Rothschild PDF
- Bull. Amer. Math. Soc. 13 (1985), 160-162
References
- Kevin J. Compton, A logical approach to asymptotic combinatorics. I. First order properties, Adv. in Math. 65 (1987), no. 1, 65–96. MR 893471, DOI 10.1016/0001-8708(87)90019-3
- P. Erdős, D. J. Kleitman, and B. L. Rothschild, Asymptotic enumeration of $K_{n}$-free graphs, Colloquio Internazionale sulle Teorie Combinatorie (Rome, 1973) Atti dei Convegni Lincei, No. 17, Accad. Naz. Lincei, Rome, 1976, pp. 19–27 (English, with Italian summary). MR 0463020
- Ronald Fagin, Probabilities on finite models, J. Symbolic Logic 41 (1976), no. 1, 50–58. MR 476480, DOI 10.2307/2272945
- D. J. Kleitman and B. L. Rothschild, Asymptotic enumeration of partial orders on a finite set, Trans. Amer. Math. Soc. 205 (1975), 205–220. MR 369090, DOI 10.1090/S0002-9947-1975-0369090-9
- A. H. Lachlan and Robert E. Woodrow, Countable ultrahomogeneous undirected graphs, Trans. Amer. Math. Soc. 262 (1980), no. 1, 51–94. MR 583847, DOI 10.1090/S0002-9947-1980-0583847-2
- R. Rado, Universal graphs and universal functions, Acta Arith. 9 (1964), 331–340. MR 172268, DOI 10.4064/aa-9-4-331-340
Additional Information
- Journal: Bull. Amer. Math. Soc. 13 (1985), 160-162
- MSC (1980): Primary 05C30, 03C13; Secondary 05A15
- DOI: https://doi.org/10.1090/S0273-0979-1985-15403-5
- MathSciNet review: 799802