{"year":"2023","month":"07","publication_identifier":{"eissn":["1098-2418"],"issn":["1042-9832"]},"quality_controlled":"1","title":"Asymmetric Ramsey properties of random graphs involving cliques and cycles","date_published":"2023-07-01T00:00:00Z","citation":{"apa":"Liebenau, A., Mattos, L., Mendonca dos Santos, W., &#38; Skokan, J. (2023). Asymmetric Ramsey properties of random graphs involving cliques and cycles. <i>Random Structures and Algorithms</i>. Wiley. <a href=\"https://doi.org/10.1002/rsa.21106\">https://doi.org/10.1002/rsa.21106</a>","ista":"Liebenau A, Mattos L, Mendonca dos Santos W, Skokan J. 2023. Asymmetric Ramsey properties of random graphs involving cliques and cycles. Random Structures and Algorithms. 62(4), 1035–1055.","chicago":"Liebenau, Anita, Letícia Mattos, Walner Mendonca dos Santos, and Jozef Skokan. “Asymmetric Ramsey Properties of Random Graphs Involving Cliques and Cycles.” <i>Random Structures and Algorithms</i>. Wiley, 2023. <a href=\"https://doi.org/10.1002/rsa.21106\">https://doi.org/10.1002/rsa.21106</a>.","ama":"Liebenau A, Mattos L, Mendonca dos Santos W, Skokan J. Asymmetric Ramsey properties of random graphs involving cliques and cycles. <i>Random Structures and Algorithms</i>. 2023;62(4):1035-1055. doi:<a href=\"https://doi.org/10.1002/rsa.21106\">10.1002/rsa.21106</a>","ieee":"A. Liebenau, L. Mattos, W. Mendonca dos Santos, and J. Skokan, “Asymmetric Ramsey properties of random graphs involving cliques and cycles,” <i>Random Structures and Algorithms</i>, vol. 62, no. 4. Wiley, pp. 1035–1055, 2023.","mla":"Liebenau, Anita, et al. “Asymmetric Ramsey Properties of Random Graphs Involving Cliques and Cycles.” <i>Random Structures and Algorithms</i>, vol. 62, no. 4, Wiley, 2023, pp. 1035–55, doi:<a href=\"https://doi.org/10.1002/rsa.21106\">10.1002/rsa.21106</a>.","short":"A. Liebenau, L. Mattos, W. Mendonca dos Santos, J. Skokan, Random Structures and Algorithms 62 (2023) 1035–1055."},"tmp":{"short":"CC BY-NC (4.0)","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","image":"/images/cc_by_nc.png","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode"},"intvolume":"        62","doi":"10.1002/rsa.21106","article_type":"original","page":"1035-1055","type":"journal_article","has_accepted_license":"1","acknowledgement":"This work was started at the thematic program GRAPHS@IMPA (January–March 2018), in Rio de Janeiro. We thank IMPA and the organisers for the hospitality and for providing a pleasant research environment. We thank Rob Morris for helpful discussions, and the anonymous referees for their careful reading and many helpful suggestions. Open Access funding enabled and organized by Projekt DEAL.\r\nA. Liebenau was supported by an ARC DECRA Fellowship Grant DE170100789. L. Mattos was supported by CAPES and by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany's Excellence Strategy – The Berlin Mathematics Research Center MATH+ (EXC-2046/1, project ID: 390685689). W. Mendonça was supported by CAPES project 88882.332408/2010-01.","ddc":["510"],"issue":"4","author":[{"full_name":"Liebenau, Anita","first_name":"Anita","last_name":"Liebenau"},{"full_name":"Mattos, Letícia","first_name":"Letícia","last_name":"Mattos"},{"full_name":"Mendonca Dos Santos, Walner","id":"12c6bd4d-2cd0-11ec-a0da-e28f42f65ebd","first_name":"Walner","last_name":"Mendonca Dos Santos"},{"full_name":"Skokan, Jozef","first_name":"Jozef","last_name":"Skokan"}],"status":"public","external_id":{"isi":["000828530400001"]},"date_updated":"2023-10-04T09:38:45Z","oa_version":"Published Version","article_processing_charge":"Yes (in subscription journal)","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","isi":1,"department":[{"_id":"MaKw"}],"publisher":"Wiley","day":"01","file":[{"date_created":"2023-10-04T09:37:26Z","access_level":"open_access","checksum":"3a5969d0c512aef01c30f3dc81c6d59b","creator":"dernst","file_name":"2023_RandomStructureAlgorithms_Liebenau.pdf","file_id":"14389","content_type":"application/pdf","date_updated":"2023-10-04T09:37:26Z","success":1,"relation":"main_file","file_size":1362334}],"scopus_import":"1","_id":"11706","oa":1,"language":[{"iso":"eng"}],"publication":"Random Structures and Algorithms","publication_status":"published","date_created":"2022-07-31T22:01:49Z","volume":62,"abstract":[{"text":"We say that (Formula presented.) if, in every edge coloring (Formula presented.), we can find either a 1-colored copy of (Formula presented.) or a 2-colored copy of (Formula presented.). The well-known states that the threshold for the property (Formula presented.) is equal to (Formula presented.), where (Formula presented.) is given by (Formula presented.) for any pair of graphs (Formula presented.) and (Formula presented.) with (Formula presented.). In this article, we show the 0-statement of the Kohayakawa–Kreuter conjecture for every pair of cycles and cliques. ","lang":"eng"}],"file_date_updated":"2023-10-04T09:37:26Z"}