{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T01:53:28Z","timestamp":1769219608154,"version":"3.49.0"},"reference-count":12,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1997,4,1]],"date-time":"1997-04-01T00:00:00Z","timestamp":859852800000},"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":5951,"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":[[1997,4]]},"DOI":"10.1016\/s0012-365x(96)00249-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:55:55Z","timestamp":1027594555000},"page":"481-486","source":"Crossref","is-referenced-by-count":22,"special_numbering":"C","title":["Hypergraph colouring and the Lov\u00e1sz Local Lemma"],"prefix":"10.1016","volume":"167-168","author":[{"given":"Colin","family":"McDiarmid","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(96)00249-X_BIB1","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1002\/rsa.3240020403","article-title":"A parallel algorithmic version of the local lemma","volume":"2","author":"Alon","year":"1991","journal-title":"Random Structures and Algorithms"},{"key":"10.1016\/S0012-365X(96)00249-X_BIB2","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BF01864169","article-title":"Every 8-uniform 8-regular hypergraph is 2-colourable","volume":"4","author":"Alon","year":"1988","journal-title":"Graphs Combin."},{"key":"10.1016\/S0012-365X(96)00249-X_BIB3","series-title":"The Probabilistic Method","author":"Alon","year":"1992"},{"key":"10.1016\/S0012-365X(96)00249-X_BIB4","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1002\/rsa.3240020402","article-title":"An algorithmic approach to the Lov\u00e1sz local lemma I","volume":"2","author":"Beck","year":"1991","journal-title":"Random Structures and Algorithms"},{"key":"10.1016\/S0012-365X(96)00249-X_BIB5","series-title":"Random Graphs","author":"Bollob\u00e1s","year":"1985"},{"key":"10.1016\/S0012-365X(96)00249-X_BIB6","series-title":"Infinite and Finite Sets","first-page":"609","article-title":"Problems and results on 3-chromatic hypergraphs and some related questions","author":"Erd\u00f6s","year":"1975"},{"key":"10.1016\/S0012-365X(96)00249-X_BIB7","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0166-218X(91)90040-4","article-title":"Lopsided Lov\u00e1sz local lemma and latin transversals","volume":"30","author":"Erd\u00f6s","year":"1991","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0012-365X(96)00249-X_BIB8","series-title":"Ramsey Theory","author":"Graham","year":"1990"},{"key":"10.1016\/S0012-365X(96)00249-X_BIB9","first-page":"13","article-title":"A lower bound for the critical probability in a certain percolation process","volume":"56","author":"Harris","year":"1960"},{"key":"10.1016\/S0012-365X(96)00249-X_BIB10","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1093\/qmath\/25.1.303","article-title":"On the two colouring of hypergraphs","volume":"25","author":"Seymour","year":"1974","journal-title":"Quart. J. Math. Oxford Series 3"},{"key":"10.1016\/S0012-365X(96)00249-X_BIB11","series-title":"Proc. 3rd Ann. ACM-SIAM Symp. on Discrete Algorithms","first-page":"41","article-title":"The probabilistic method","author":"Spencer","year":"1992"},{"key":"10.1016\/S0012-365X(96)00249-X_BIB12","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1090\/S0894-0347-1992-1135027-1","article-title":"The even cycle problem for directed graphs","volume":"5","author":"Thomassen","year":"1992","journal-title":"J. Amer. Math. Soc."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X9600249X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X9600249X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T16:25:44Z","timestamp":1556382344000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X9600249X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,4]]},"references-count":12,"alternative-id":["S0012365X9600249X"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(96)00249-x","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,4]]}}}