{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T20:05:25Z","timestamp":1777579525177,"version":"3.51.4"},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1987,1,1]],"date-time":"1987-01-01T00:00:00Z","timestamp":536457600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9694,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series A"],"published-print":{"date-parts":[[1987,1]]},"DOI":"10.1016\/0097-3165(87)90061-6","type":"journal-article","created":{"date-parts":[[2004,11,6]],"date-time":"2004-11-06T13:03:10Z","timestamp":1099746190000},"page":"83-93","source":"Crossref","is-referenced-by-count":18,"title":["Counting unlabeled structures"],"prefix":"10.1016","volume":"44","author":[{"given":"Hans","family":"J\u00fcrgen Pr\u00f6mel","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0097-3165(87)90061-6_BIB1","series-title":"Model Theory","author":"Chang","year":"1973"},{"key":"10.1016\/0097-3165(87)90061-6_BIB2","doi-asserted-by":"crossref","unstructured":"K. J. Compton, A logical approach to asymptotic combinatorics. I. First-order properties; Adv. in Math., in press.","DOI":"10.1016\/0001-8708(87)90019-3"},{"key":"10.1016\/0097-3165(87)90061-6_BIB3","series-title":"Int. Colloq. Combin. Theory","first-page":"19","article-title":"Asymptotic enumeration of Kl+1-free graphs","volume":"Vol. 2","author":"Erdos","year":"1976"},{"key":"10.1016\/0097-3165(87)90061-6_BIB4","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1215\/S0012-7094-41-00826-8","article-title":"The distribution of the number of summands in the partitions of a positive integer","volume":"8","author":"Erd\u00f6s","year":"1941","journal-title":"Duke Math. J."},{"key":"10.1016\/0097-3165(87)90061-6_BIB5","doi-asserted-by":"crossref","first-page":"50","DOI":"10.2307\/2272945","article-title":"Probabilities on finite models","volume":"41","author":"Fagin","year":"1976","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0097-3165(87)90061-6_BIB6","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0012-365X(77)90116-9","article-title":"The number of finite relational structures","volume":"19","author":"Fagin","year":"1977","journal-title":"Discrete Math."},{"key":"10.1016\/0097-3165(87)90061-6_BIB7","unstructured":"U. Faigle and Gy. Tur\u00e1n, On the complexity of interval and sermorders, Discrete Math., in press."},{"key":"10.1016\/0097-3165(87)90061-6_BIB8","first-page":"163","article-title":"Combinatorial problems in the theory of graphs","volume":"43","author":"Ford","year":"1957"},{"key":"10.1016\/0097-3165(87)90061-6_BIB9","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1090\/S0002-9947-1975-0369090-9","article-title":"Asymptotic enumeration of partial orders on a finite set","volume":"205","author":"Kleitman","year":"1975","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0097-3165(87)90061-6_BIB10","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1090\/S0273-0979-1985-15403-5","article-title":"Asymptotic enumeration and a 0\u20131 law for m-clique free graphs","volume":"13","author":"Kolaitis","year":"1985","journal-title":"Bull. Amer. Math. Soc. (N. S.)"},{"key":"10.1016\/0097-3165(87)90061-6_BIB11","unstructured":"Ph. G. Kolaitis, H. J. Promel, and B. L. Rothschild, Kl+1-free graphs: Asymptotic structure and a 0\u20131 law, Trans. Amer. Math. Soc., to appear."},{"key":"10.1016\/0097-3165(87)90061-6_BIB12","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1090\/S0002-9947-1980-0583847-2","article-title":"Countable ultrahomogeneous graphs","volume":"262","author":"Lachlan","year":"1980","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0097-3165(87)90061-6_BIB13","series-title":"Graphs and Order","article-title":"Problem session, Problem 1.7, in","author":"M\u00f6hring","year":"1985"},{"key":"10.1016\/0097-3165(87)90061-6_BIB14","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BF01363123","article-title":"Kombinatorische Anzahlbestimmungen in Relationen","volume":"174","author":"Oberschelp","year":"1967","journal-title":"Math. Ann."},{"key":"10.1016\/0097-3165(87)90061-6_BIB15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02392023","article-title":"Graphs on unlabeled nodes with a given number of edges","volume":"126","author":"Wright","year":"1971","journal-title":"Acta Math."}],"container-title":["Journal of Combinatorial Theory, Series A"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0097316587900616?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0097316587900616?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,2]],"date-time":"2019-02-02T04:23:35Z","timestamp":1549081415000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0097316587900616"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,1]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1987,1]]}},"alternative-id":["0097316587900616"],"URL":"https:\/\/doi.org\/10.1016\/0097-3165(87)90061-6","relation":{},"ISSN":["0097-3165"],"issn-type":[{"value":"0097-3165","type":"print"}],"subject":[],"published":{"date-parts":[[1987,1]]}}}