|
Asymptotic enumeration and a 0-1 law for $m$-clique free graphs
Author(s):
Ph. G.
Kolaitis;
H.-J.
Prömel;
B. L.
Rothschild
Journal:
Bull. Amer. Math. Soc.
13
(1985),
160-162.
MSC (1980):
Primary 05C30, 03C13;
Secondary 05A15
MathSciNet review:
799802
Retrieve article in:
PDF
References |
Similar articles |
Additional information
References:
- K. J. Compton [1984], A logical approach to asymptotic combinatorics. I, First-order properties, Adv. in Math. (to appear). MR 893471
- P. Erdös, D. J. Kleitman and B. L. Rothschild [1976], Asymptotic enumeration of K, International Colloquium on Combinatorial Theory, Atti dei Convegni Lincei No. 17, Volume 2, Rome, 1976, pp. 19-27. MR 463020
- R. Fagin [1976], Probabilities on finite models, J. Symbolic Logic 41 (1976), 50-58. MR 476480
- D. J. Kleitman and B. L. Rothschild [1975], Asymptotic enumeration of partial orders on a finite set, Trans. Amer. Math. Soc. 205 (1975), 205-220. MR 369090
- A. H. Lachlan and R. E. Woodrow [1980], Countable ultrahomogeneous graphs, Trans. Amer. Math. Soc. 262 (1980), 51-94. MR 583847
- R. Rado [1964], Universal graphs and universal functions, Acta Arith. 9 (1964), 331-340. MR 172268
Similar Articles:
Retrieve articles in Bulletin of the American Mathematical Society
with MSC
(1980):
05C30, 03C13, 05A15
Retrieve articles in all Journals with MSC
(1980):
05C30, 03C13, 05A15
Additional Information:
DOI:
10.1090/S0273-0979-1985-15403-5
PII:
S 0273-0979(1985)15403-5
|
