[{"month":"08","intvolume":"        43","publication_identifier":{"eissn":["1439-6912"],"issn":["0209-9683"]},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2111.05420"}],"publisher":"Springer Nature","OA_place":"repository","publication":"Combinatorica","status":"public","arxiv":1,"article_processing_charge":"No","title":"Three early problems on size Ramsey numbers","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2023","page":"743-768","date_published":"2023-08-01T00:00:00Z","oa_version":"Preprint","volume":43,"external_id":{"arxiv":["2111.05420"]},"author":[{"full_name":"Conlon, David","first_name":"David","last_name":"Conlon"},{"full_name":"Fox, Jacob","first_name":"Jacob","last_name":"Fox"},{"id":"2d0023a0-1567-11f0-833d-d5c1e476d4b5","last_name":"Wigderson","first_name":"Yuval","full_name":"Wigderson, Yuval"}],"issue":"4","_id":"22159","extern":"1","date_updated":"2026-07-08T10:34:40Z","citation":{"ieee":"D. Conlon, J. Fox, and Y. Wigderson, “Three early problems on size Ramsey numbers,” <i>Combinatorica</i>, vol. 43, no. 4. Springer Nature, pp. 743–768, 2023.","mla":"Conlon, David, et al. “Three Early Problems on Size Ramsey Numbers.” <i>Combinatorica</i>, vol. 43, no. 4, Springer Nature, 2023, pp. 743–68, doi:<a href=\"https://doi.org/10.1007/s00493-023-00034-7\">10.1007/s00493-023-00034-7</a>.","short":"D. Conlon, J. Fox, Y. Wigderson, Combinatorica 43 (2023) 743–768.","chicago":"Conlon, David, Jacob Fox, and Yuval Wigderson. “Three Early Problems on Size Ramsey Numbers.” <i>Combinatorica</i>. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/s00493-023-00034-7\">https://doi.org/10.1007/s00493-023-00034-7</a>.","ista":"Conlon D, Fox J, Wigderson Y. 2023. Three early problems on size Ramsey numbers. Combinatorica. 43(4), 743–768.","ama":"Conlon D, Fox J, Wigderson Y. Three early problems on size Ramsey numbers. <i>Combinatorica</i>. 2023;43(4):743-768. doi:<a href=\"https://doi.org/10.1007/s00493-023-00034-7\">10.1007/s00493-023-00034-7</a>","apa":"Conlon, D., Fox, J., &#38; Wigderson, Y. (2023). Three early problems on size Ramsey numbers. <i>Combinatorica</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00493-023-00034-7\">https://doi.org/10.1007/s00493-023-00034-7</a>"},"quality_controlled":"1","language":[{"iso":"eng"}],"oa":1,"abstract":[{"text":"The size Ramsey number of a graph H is defined as the minimum number of edges in a graph G such that there is a monochromatic copy of H in every two-coloring of E(G). The size Ramsey number was introduced by Erdős, Faudree, Rousseau, and Schelp in 1978 and they ended their foundational paper by asking whether one can determine up to a constant factor the size Ramsey numbers of three families of graphs: complete bipartite graphs, book graphs (obtained by adding many common neighbors to the vertices of a clique), and starburst graphs (obtained by adding many pendant edges to each vertex of a clique). In this paper, we completely resolve the latter two questions and make substantial progress on the first by determining the size Ramsey number of Ks,t up to a constant factor for all t=Ω(s log s).","lang":"eng"}],"scopus_import":"1","OA_type":"green","day":"01","article_type":"original","doi":"10.1007/s00493-023-00034-7","type":"journal_article","date_created":"2026-06-29T10:51:32Z","publication_status":"published"}]