{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T09:08:12Z","timestamp":1726477692761},"reference-count":10,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":4576,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Random Struct Algorithms"],"published-print":{"date-parts":[[1994,4]]},"abstract":"Abstract<\/jats:title>We prove that for every r<\/jats:italic> \u2a7e 2 there is C<\/jats:italic> > 0 such that if p<\/jats:italic> Cn<\/jats:italic>\u22121\/2<\/jats:sup> then almost surely every r<\/jats:italic>\u2010coloring of the edges of the binomial random graph K<\/jats:italic>(n, p<\/jats:italic>) results in a monochromatic triangle. \u00a9 1994 John Wiley & Sons, Inc.<\/jats:p>","DOI":"10.1002\/rsa.3240050202","type":"journal-article","created":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T20:52:52Z","timestamp":1180731172000},"page":"253-270","source":"Crossref","is-referenced-by-count":46,"title":["Random graphs with monochromatic triangles in every edge coloring"],"prefix":"10.1002","volume":"5","author":[{"given":"Vojtech","family":"R\u00f6dl","sequence":"first","affiliation":[]},{"given":"Andrzej","family":"Ruci\u0144ski","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","unstructured":"N.Alon R. A.Duke H.Lefmann V.R\u00f6dl andR.Yuster The algorithmic aspects of the regularity lemma submitted."},{"key":"e_1_2_1_3_2","volume-title":"The Probabilistic Method","author":"Alon N.","year":"1992"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579198"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1137\/0118004"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01788087"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240010209"},{"key":"e_1_2_1_8_2","first-page":"73","volume-title":"Proceedings of Random Graphs' 87","author":"Janson S.","year":"1990"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(92)90006-J"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579159"},{"key":"e_1_2_1_11_2","first-page":"399","article-title":"Regular Partitions of Graphs","volume":"260","author":"Szemer\u00e9di E.","year":"1978","journal-title":"Probl. Combinat. Theorie Graph., Editions du C.N.R.S."}],"container-title":["Random Structures & Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Frsa.3240050202","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/rsa.3240050202","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,15]],"date-time":"2023-10-15T22:34:28Z","timestamp":1697409268000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/rsa.3240050202"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,4]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,4]]}},"alternative-id":["10.1002\/rsa.3240050202"],"URL":"https:\/\/doi.org\/10.1002\/rsa.3240050202","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,4]]}}}