{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T03:35:05Z","timestamp":1777520105814,"version":"3.51.4"},"reference-count":24,"publisher":"Cambridge University Press (CUP)","issue":"6","license":[{"start":{"date-parts":[[2020,6,24]],"date-time":"2020-06-24T00:00:00Z","timestamp":1592956800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["Combinator. Probab. Comp."],"published-print":{"date-parts":[[2020,11]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>For fixed graphs <jats:italic>F<\/jats:italic><jats:sub>1<\/jats:sub>,\u2026,<jats:italic>F<\/jats:italic><jats:sub><jats:italic>r<\/jats:italic><\/jats:sub>, we prove an upper bound on the threshold function for the property that <jats:italic>G<\/jats:italic>(<jats:italic>n<\/jats:italic>, <jats:italic>p<\/jats:italic>) \u2192 (<jats:italic>F<\/jats:italic><jats:sub>1<\/jats:sub>,\u2026,<jats:italic>F<\/jats:italic><jats:sub><jats:italic>r<\/jats:italic><\/jats:sub>). This establishes the 1-statement of a conjecture of Kohayakawa and Kreuter.<\/jats:p>","DOI":"10.1017\/s0963548320000267","type":"journal-article","created":{"date-parts":[[2020,6,24]],"date-time":"2020-06-24T08:47:47Z","timestamp":1592988467000},"page":"943-955","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":10,"title":["Towards the Kohayakawa\u2013Kreuter conjecture on asymmetric Ramsey properties"],"prefix":"10.1017","volume":"29","author":[{"given":"Frank","family":"Mousset","sequence":"first","affiliation":[]},{"given":"Rajko","family":"Nenadov","sequence":"additional","affiliation":[]},{"given":"Wojciech","family":"Samotij","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2020,6,24]]},"reference":[{"key":"S0963548320000267_ref15","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(92)90006-J"},{"key":"S0963548320000267_ref6","doi-asserted-by":"publisher","DOI":"10.1090\/memo\/0845"},{"key":"S0963548320000267_ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s11856-014-1120-1"},{"key":"S0963548320000267_ref7","doi-asserted-by":"publisher","DOI":"10.1017\/fms.2017.22"},{"key":"S0963548320000267_ref13","doi-asserted-by":"publisher","DOI":"10.1007\/BF01200906"},{"key":"S0963548320000267_ref20","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240050202"},{"key":"S0963548320000267_ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s00222-014-0562-8"},{"key":"S0963548320000267_ref12","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199710)11:3<245::AID-RSA3>3.0.CO;2-0"},{"key":"S0963548320000267_ref14","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20446"},{"key":"S0963548320000267_ref11","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032718"},{"key":"S0963548320000267_ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2016.12.007"},{"key":"S0963548320000267_ref22","first-page":"181","article-title":"Balanced graphs and the problem of subgraphs of random graphs","volume":"49","author":"Ruci\u0144ski","year":"1985","journal-title":"Congr. Numer."},{"key":"S0963548320000267_ref21","doi-asserted-by":"publisher","DOI":"10.2307\/2152833"},{"key":"S0963548320000267_ref24","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20723"},{"key":"S0963548320000267_ref8","doi-asserted-by":"publisher","DOI":"10.1137\/18M119642X"},{"key":"S0963548320000267_ref9","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199810\/12)13:3\/4<467::AID-RSA15>3.0.CO;2-W"},{"key":"S0963548320000267_ref5","doi-asserted-by":"publisher","DOI":"10.1002\/1098-2418(200008)17:1<1::AID-RSA1>3.0.CO;2-4"},{"key":"S0963548320000267_ref4","doi-asserted-by":"publisher","DOI":"10.1007\/BF01788087"},{"key":"S0963548320000267_ref2","doi-asserted-by":"publisher","DOI":"10.1142\/9789813272880_0172"},{"key":"S0963548320000267_ref10","unstructured":"[10] Janson, S. , \u0141uczak, T. and Ruci\u0144ski, A. (1990) An exponential bound for the probability of nonexistence of a specified subgraph in a random graph. In Random Graphs \u201987 (Pozna\u0144, 1987), pp. 73\u201387, Wiley."},{"key":"S0963548320000267_ref18","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548314000832"},{"key":"S0963548320000267_ref19","unstructured":"[19] R\u00f6dl, V. and Ruci\u0144ski, A. (1993) Lower bounds on probability thresholds for Ramsey properties. In Combinatorics: Paul Erd\u00f6s is Eighty, Vol. 1, Bolyai Society Mathematical Studies, pp. 317\u2013346, J\u00e1nos Bolyai Mathematical Society."},{"key":"S0963548320000267_ref1","doi-asserted-by":"publisher","DOI":"10.1090\/S0894-0347-2014-00816-X"},{"key":"S0963548320000267_ref16","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20239"}],"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548320000267","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,11]],"date-time":"2020-11-11T12:45:42Z","timestamp":1605098742000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0963548320000267\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,24]]},"references-count":24,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2020,11]]}},"alternative-id":["S0963548320000267"],"URL":"https:\/\/doi.org\/10.1017\/s0963548320000267","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,6,24]]},"assertion":[{"value":"\u00a9 The Author(s), 2020. Published by Cambridge University Press","name":"copyright","label":"Copyright","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}}]}}