{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T13:16:47Z","timestamp":1780579007682,"version":"3.54.1"},"reference-count":21,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1981,1,1]],"date-time":"1981-01-01T00:00:00Z","timestamp":347155200000},"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":11885,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1981]]},"DOI":"10.1016\/0012-365x(81)90253-3","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T15:17:01Z","timestamp":1034090221000},"page":"1-19","source":"Crossref","is-referenced-by-count":76,"title":["Degree sequences of random graphs"],"prefix":"10.1016","volume":"33","author":[{"given":"B\u00e9la","family":"Bollob\u00e1s","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(81)90253-3_BIB1","series-title":"Extremal Graph Theory","author":"Bollob\u00e1s","year":"1978"},{"key":"10.1016\/0012-365X(81)90253-3_BIB2","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0012-365X(78)90102-4","article-title":"Chromatic number, girth and maximum degree","volume":"24","author":"Bollob\u00e1s","year":"1978","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(81)90253-3_BIB3","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0012-365X(79)90139-0","article-title":"Graphs with equal minimum degree and edge connectivity","volume":"28","author":"Bollob\u00e1s","year":"1979","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(81)90253-3_BIB4","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1017\/S0305004100053056","article-title":"Cliques in random graphs","volume":"80","author":"Bollob\u00e1s","year":"1976","journal-title":"Proc. Cambridge Philos. Soc."},{"key":"10.1016\/0012-365X(81)90253-3_BIB5","doi-asserted-by":"crossref","first-page":"1340","DOI":"10.4153\/CJM-1976-133-5","article-title":"Uniquely colourable graphs with large girth","volume":"28","author":"Bollob\u00e1s","year":"1976","journal-title":"Canad. J. Math."},{"issue":"2","key":"10.1016\/0012-365X(81)90253-3_BIB6","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1112\/jlms\/s2-16.3.403","article-title":"Uniquely partitionable graphs","volume":"16","author":"Bollob\u00e1s","year":"1977","journal-title":"J. London Math. Soc."},{"key":"10.1016\/0012-365X(81)90253-3_BIB7","doi-asserted-by":"crossref","first-page":"34","DOI":"10.4153\/CJM-1959-003-9","article-title":"Graph theory and probability","volume":"11","author":"Erd\u00f6s","year":"1959","journal-title":"Canad. J. Math."},{"key":"10.1016\/0012-365X(81)90253-3_BIB8","doi-asserted-by":"crossref","first-page":"346","DOI":"10.4153\/CJM-1961-029-9","article-title":"Graph theory and probability II","volume":"13","author":"Erd\u00f6s","year":"1961","journal-title":"Canad. J. Math."},{"key":"10.1016\/0012-365X(81)90253-3_BIB9","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","article-title":"On random graphs I","volume":"6","author":"Erd\u00f6s","year":"1959","journal-title":"Publ. Math. Debrecen"},{"key":"10.1016\/0012-365X(81)90253-3_BIB10","first-page":"17","article-title":"On the evolution of random graphs","volume":"5","author":"Erd\u00f6s","year":"1960","journal-title":"Publ. Math. Inst. Hungar. Acad. Sci."},{"key":"10.1016\/0012-365X(81)90253-3_BIB11","series-title":"Probability Methods in Combinatorics","author":"Erd\u00f6s","year":"1974"},{"key":"10.1016\/0012-365X(81)90253-3_BIB12","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0095-8956(77)90039-9","article-title":"On the chromatic index of almost all graphs","volume":"23","author":"Erd\u00f6s","year":"1977","journal-title":"J. Combinatorial Theory Ser. B"},{"key":"10.1016\/0012-365X(81)90253-3_BIB13","volume":"vol. 1","author":"Feller","year":"1975"},{"key":"10.1016\/0012-365X(81)90253-3_BIB14","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1017\/S0305004100051124","article-title":"On colouring random graphs","volume":"77","author":"Grimmett","year":"1975","journal-title":"Proc. Cambridge Philos. Soc."},{"key":"10.1016\/0012-365X(81)90253-3_BIB15","doi-asserted-by":"crossref","first-page":"43","DOI":"10.2307\/1426408","article-title":"On the probability in the tail of the binomial distribution","volume":"1","author":"Littlewood","year":"1979","journal-title":"Advances in Appl. Probability"},{"key":"10.1016\/0012-365X(81)90253-3_BIB16","series-title":"Combinatory Mathematics and Its Applications","first-page":"356","article-title":"On the complete subgraphs of a random graph","author":"Matula","year":"1970"},{"key":"10.1016\/0012-365X(81)90253-3_BIB17","unstructured":"D.W. Matula, The employee party problem, Preprint."},{"key":"10.1016\/0012-365X(81)90253-3_BIB18","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0012-365X(76)90068-6","article-title":"Hamiltonian cycles in random graphs","volume":"14","author":"P\u00f3sa","year":"1976","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(81)90253-3_BIB19","series-title":"Foundations of Probability","author":"R\u00e9nyi","year":"1970"},{"key":"10.1016\/0012-365X(81)90253-3_BIB20","unstructured":"N. Sauer and J. Spencer, Edge disjoint placements of graphs, J. Combinatorial Theory Ser. B."},{"key":"10.1016\/0012-365X(81)90253-3_BIB21","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0012-365X(72)90084-2","article-title":"Tur\u00e1n's theorem for k-graphs","volume":"2","author":"Spencer","year":"1972","journal-title":"Discrete Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X81902533?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X81902533?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,24]],"date-time":"2023-04-24T11:06:34Z","timestamp":1682334394000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X81902533"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1981]]}},"alternative-id":["0012365X81902533"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(81)90253-3","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1981]]}}}