{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T13:08:41Z","timestamp":1783170521986,"version":"3.54.6"},"reference-count":15,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2007,7,5]],"date-time":"2007-07-05T00:00:00Z","timestamp":1183593600000},"content-version":"vor","delay-in-days":5695,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Random Struct Algorithms"],"published-print":{"date-parts":[[1991,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The Lov\u00e1sz Local Lemma is a remarkable sieve method to prove the <jats:italic>existence<\/jats:italic> of certain structures without supplying any efficient way of <jats:italic>finding<\/jats:italic> these structures. In this article we convert some of the applications of the Local Lemma into polynomial time sequential algorithms (at the cost of a weaker constant factor in the \u201cexponent\u201d). Our main example is the following: assume that in an n\u2010uniform hypergraph every hyperedge intersects at most 2<jats:sup>n\/48<\/jats:sup> other hyperedges, then there is a polynomial time algorithm that finds a two\u2010coloring of the points such that <jats:italic>no<\/jats:italic> hyperedge is monochromatic.<\/jats:p>","DOI":"10.1002\/rsa.3240020402","type":"journal-article","created":{"date-parts":[[2010,7,12]],"date-time":"2010-07-12T08:05:53Z","timestamp":1278921953000},"page":"343-365","source":"Crossref","is-referenced-by-count":166,"title":["An algorithmic approach to the Lov\u00e1sz local lemma. I"],"prefix":"10.1002","volume":"2","author":[{"given":"J\u00f3zsef","family":"Beck","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"311","published-online":{"date-parts":[[2007,7,5]]},"reference":[{"key":"e_1_2_1_1_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(89)90073-3"},{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02783300"},{"key":"e_1_2_1_3_2","article-title":"The strong chromatic number of a graph","author":"Alon N.","journal-title":"Random Struct. Alg."},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240020403"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(89)90071-3"},{"key":"e_1_2_1_6_2","author":"Alon N.","journal-title":"Star arboricity, Combinatorica"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240020303"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(78)90191-7"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(81)90001-7"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579267"},{"key":"e_1_2_1_11_2","first-page":"609","volume-title":"Infinite and Finite Sets","author":"Erd\u014ds P.","year":"1975"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(73)90005-8"},{"key":"e_1_2_1_13_2","volume-title":"Combinatorial Problems and Exercises","author":"Lov\u00e1sz L.","year":"1979"},{"key":"e_1_2_1_14_2","unstructured":"J.Spencer Ten Lectures on the Probabilistic Method SIAM Philadelphia 1987."},{"key":"e_1_2_1_15_2","unstructured":"J.Spencer The Probabilistic Method Lecture Notes for Lab. Comp. Sci. (RSS 9) MIT 1990."}],"container-title":["Random Structures &amp; Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Frsa.3240020402","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Frsa.3240020402","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/rsa.3240020402","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T06:15:24Z","timestamp":1698041724000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/rsa.3240020402"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,12]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1991,12]]}},"alternative-id":["10.1002\/rsa.3240020402"],"URL":"https:\/\/doi.org\/10.1002\/rsa.3240020402","archive":["Portico"],"relation":{},"ISSN":["1042-9832","1098-2418"],"issn-type":[{"value":"1042-9832","type":"print"},{"value":"1098-2418","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,12]]}}}