{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T02:39:27Z","timestamp":1773542367551,"version":"3.50.1"},"reference-count":4,"publisher":"Wiley","issue":"5","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":4332,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Random Struct Algorithms"],"published-print":{"date-parts":[[1994,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We show that as <jats:italic>n<\/jats:italic>\u2192\u221e, the independence number \u03b1(<jats:italic>G<\/jats:italic>), for almost all 3\u2010regular graphs <jats:italic>G<\/jats:italic> on <jats:italic>n<\/jats:italic> vertices, is at least (6 log(3\/2) \u2013 2 \u2013 \u03f5)<jats:italic>n<\/jats:italic>, for any constant \u03f5&gt;0. We prove this by analyzing a greedy algorithm for finding independent sets. \u00a9 1994 John Wiley &amp; Sons, Inc.<\/jats:p>","DOI":"10.1002\/rsa.3240050504","type":"journal-article","created":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T21:24:46Z","timestamp":1180733086000},"page":"649-664","source":"Crossref","is-referenced-by-count":17,"title":["On the independence number of random cubic graphs"],"prefix":"10.1002","volume":"5","author":[{"given":"Alan","family":"Frieze","sequence":"first","affiliation":[]},{"given":"Stephen","family":"Suen","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(78)90059-6"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0195-6698(80)80030-8"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(92)90070-E"},{"key":"e_1_2_1_5_2","unstructured":"A. M.Frieze A. J.Radcliffe andS.Suen Analysis of a simple matching algorithm on random cubic graphs 341\u2013351 SODA1993."}],"container-title":["Random Structures &amp; Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Frsa.3240050504","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/rsa.3240050504","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T03:41:12Z","timestamp":1698118872000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/rsa.3240050504"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":4,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1994,12]]}},"alternative-id":["10.1002\/rsa.3240050504"],"URL":"https:\/\/doi.org\/10.1002\/rsa.3240050504","archive":["Portico"],"relation":{},"ISSN":["1042-9832","1098-2418"],"issn-type":[{"value":"1042-9832","type":"print"},{"value":"1098-2418","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}