Séminaire Lotharingien de Combinatoire, B15g (1986).
[Formerly: Publ. I.R.M.A. Strasbourg, 1987, 340/S-15, p. 89-95.]

Hans Jürgen Prömel

Aspects of Asymptotic Graph Theory

Abstract. The aim of this note is to shed some light on the link between enumeration problems for labeled graphs and orders and those for unlabeled ones.

This is a report on the papers:

Ph. G. Kolaitis, H. J. Prömel, B. L. Rothschild, K_l+1-free graphs: asymptotic structure and a 0-1 law, Trans. Amer. Math. Soc. 303 (1987), 637-671.

Hans Jürgen Prömel, Counting unlabeled structures, J. Combin. Theory Ser. A 44 (1987), 83-93.

Séminaire Lotharingien de Combinatoire, B15g (1986). [Formerly: Publ. I.R.M.A. Strasbourg, 1987, 340/S-15, p. 89-95.]

Hans Jürgen Prömel

Aspects of Asymptotic Graph Theory

Séminaire Lotharingien de Combinatoire, B15g (1986).
[Formerly: Publ. I.R.M.A. Strasbourg, 1987, 340/S-15, p. 89-95.]