{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/paley-like-graphs-for-the-ramsey-number-r-c-4","title":"Paley-like graphs for the Ramsey number $r(C_4,K_t)$","arxiv_id":"2108.08753","date":"2021-08-19","proceeding":null,"authors":["Yuval Wigderson"],"abstract":"An earlier version of this paper constructed a family of $n$-vertex $C_4$-free graphs which we conjectured to have independence number $n^{\\frac 12+o(1)}$. This conjecture is false, as pointed out by Michael Tait.","url_abs":"https://arxiv.org/abs/2108.08753v2","url_pdf":"https://arxiv.org/pdf/2108.08753v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"links_only","authors_date_abstract":"arXiv metadata, CC0 1.0 (https://info.arxiv.org/help/license), from the Kaggle arXiv metadata snapshot of 2026-09-12"},"code_links":[{"paper_slug":"paley-like-graphs-for-the-ramsey-number-r-c-4","repo_url":"https://github.com/yuvalwig/paley-c4","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}