Aspects of Asymptotic Graph Theory
Séminaire lotharingien de combinatoire, Tome 15 (1986)
Voir la notice de l'acte provenant de la source Séminaire Lotharingien de Combinatoire website
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, Kl+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.
@article{SLC_1986_15_a6,
author = {Hans J\"urgen Pr\"omel},
title = {Aspects of {Asymptotic} {Graph} {Theory}},
journal = {S\'eminaire lotharingien de combinatoire},
publisher = {mathdoc},
volume = {15},
year = {1986},
url = {http://geodesic.mathdoc.fr/item/SLC_1986_15_a6/}
}
Hans Jürgen Prömel. Aspects of Asymptotic Graph Theory. Séminaire lotharingien de combinatoire, Tome 15 (1986). http://geodesic.mathdoc.fr/item/SLC_1986_15_a6/