{"paper":{"title":"Anti-Ramsey Multiplicities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jessica De Silva, Michael Tait, Michael Young, Ruifan Yang, Xiang Si, Yunus Tun\\c{c}bilek","submitted_at":"2018-01-01T16:55:10Z","abstract_excerpt":"The Ramsey multiplicity constant of a graph $H$ is the minimum proportion of copies of $H$ in the complete graph which are monochromatic under an edge-coloring of $K_n$ as $n$ goes to infinity. Graphs for which this minimum is asymptotically achieved by taking a random coloring are called {\\em common}, and common graphs have been studied extensively, leading to the Burr-Rosta conjecture and Sidorenko's conjecture. Erd\\H{o}s and S\\'os asked what the maximum number of rainbow triangles is in a $3$-coloring of the edge set of $K_n$, a rainbow version of the Ramsey multiplicity question. A graph $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.00474","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}