{"citation":{"mla":"Kwan, Matthew Alan, and Benny Sudakov. “Ramsey Graphs Induce Subgraphs of Quadratically Many Sizes.” <i>International Mathematics Research Notices</i>, vol. 2020, no. 6, Oxford University Press, 2020, pp. 1621–1638, doi:<a href=\"https://doi.org/10.1093/imrn/rny064\">10.1093/imrn/rny064</a>.","short":"M.A. Kwan, B. Sudakov, International Mathematics Research Notices 2020 (2020) 1621–1638.","ista":"Kwan MA, Sudakov B. 2020. Ramsey graphs induce subgraphs of quadratically many sizes. International Mathematics Research Notices. 2020(6), 1621–1638.","chicago":"Kwan, Matthew Alan, and Benny Sudakov. “Ramsey Graphs Induce Subgraphs of Quadratically Many Sizes.” <i>International Mathematics Research Notices</i>. Oxford University Press, 2020. <a href=\"https://doi.org/10.1093/imrn/rny064\">https://doi.org/10.1093/imrn/rny064</a>.","ama":"Kwan MA, Sudakov B. Ramsey graphs induce subgraphs of quadratically many sizes. <i>International Mathematics Research Notices</i>. 2020;2020(6):1621–1638. doi:<a href=\"https://doi.org/10.1093/imrn/rny064\">10.1093/imrn/rny064</a>","apa":"Kwan, M. A., &#38; Sudakov, B. (2020). Ramsey graphs induce subgraphs of quadratically many sizes. <i>International Mathematics Research Notices</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/imrn/rny064\">https://doi.org/10.1093/imrn/rny064</a>","ieee":"M. A. Kwan and B. Sudakov, “Ramsey graphs induce subgraphs of quadratically many sizes,” <i>International Mathematics Research Notices</i>, vol. 2020, no. 6. Oxford University Press, pp. 1621–1638, 2020."},"_id":"9577","publication_identifier":{"issn":["1073-7928"],"eissn":["1687-0247"]},"oa":1,"type":"journal_article","scopus_import":"1","date_updated":"2023-02-23T14:01:33Z","volume":2020,"intvolume":"      2020","page":"1621–1638","article_type":"original","publication_status":"published","article_processing_charge":"No","author":[{"orcid":"0000-0002-4003-7567","full_name":"Kwan, Matthew Alan","last_name":"Kwan","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","first_name":"Matthew Alan"},{"last_name":"Sudakov","first_name":"Benny","full_name":"Sudakov, Benny"}],"extern":"1","status":"public","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1093/imrn/rny064"}],"quality_controlled":"1","title":"Ramsey graphs induce subgraphs of quadratically many sizes","language":[{"iso":"eng"}],"issue":"6","day":"01","month":"03","oa_version":"Published Version","publication":"International Mathematics Research Notices","publisher":"Oxford University Press","year":"2020","doi":"10.1093/imrn/rny064","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","external_id":{"arxiv":["1711.02937"]},"date_published":"2020-03-01T00:00:00Z","date_created":"2021-06-21T08:30:12Z","abstract":[{"lang":"eng","text":"An n-vertex graph is called C-Ramsey if it has no clique or independent set of size Clogn⁠. All known constructions of Ramsey graphs involve randomness in an essential way, and there is an ongoing line of research towards showing that in fact all Ramsey graphs must obey certain “richness” properties characteristic of random graphs. Motivated by an old problem of Erd̋s and McKay, recently Narayanan, Sahasrabudhe, and Tomon conjectured that for any fixed C, every n-vertex C-Ramsey graph induces subgraphs of Θ(n2) different sizes. In this paper we prove this conjecture."}]}