Anti-Ramsey Multiplicities

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 commo...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: De Silva, Jessica, Si, Xiang, Tait, Michael, Tunçbilek, Yunus, Yang, Ruifan, Young, Michael
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator De Silva, Jessica
Si, Xiang
Tait, Michael
Tunçbilek, Yunus
Yang, Ruifan
Young, Michael
description 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 $H$ is called $r$-anti-common if the maximum proportion of rainbow copies of $H$ in any $r$-coloring of $E(K_n)$ is asymptotically achieved by taking a random coloring. In this paper, we investigate anti-Ramsey multiplicity for several families of graphs. We determine classes of graphs which are either anti-common or not. Some of these classes follow the same behavior as the monochromatic case, but some of them do not. In particular the rainbow equivalent of Sidorenko's conjecture, that all bipartite graphs are anti-common, is false.
doi_str_mv 10.48550/arxiv.1801.00474
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1801_00474</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1801_00474</sourcerecordid><originalsourceid>FETCH-LOGICAL-a674-eabc5f96b22dfa9c5341e7f54626c133c1ce9f0ce7ecafd7c12a1f656619f6c53</originalsourceid><addsrcrecordid>eNotzs0KgkAUhuHZtAjrAmpTN6DNGecnlyH9gRGEezkeZ2DAItQi776yVt_m5eNhbAY8kmul-Aqbl39GsOYQcS6NHLP55tb58ILX1vbL06Pu_L325Dtv2wkbOaxbO_1vwPLdNk8PYXbeH9NNFqI2MrRYknKJLoWoHCakYgnWOCW10ARxTEA2cZyssYSuMgQCwWmlNSROf_KALX63A664N_6KTV98kcWAjN9bnjal</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Anti-Ramsey Multiplicities</title><source>arXiv.org</source><creator>De Silva, Jessica ; Si, Xiang ; Tait, Michael ; Tunçbilek, Yunus ; Yang, Ruifan ; Young, Michael</creator><creatorcontrib>De Silva, Jessica ; Si, Xiang ; Tait, Michael ; Tunçbilek, Yunus ; Yang, Ruifan ; Young, Michael</creatorcontrib><description>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 $H$ is called $r$-anti-common if the maximum proportion of rainbow copies of $H$ in any $r$-coloring of $E(K_n)$ is asymptotically achieved by taking a random coloring. In this paper, we investigate anti-Ramsey multiplicity for several families of graphs. We determine classes of graphs which are either anti-common or not. Some of these classes follow the same behavior as the monochromatic case, but some of them do not. In particular the rainbow equivalent of Sidorenko's conjecture, that all bipartite graphs are anti-common, is false.</description><identifier>DOI: 10.48550/arxiv.1801.00474</identifier><language>eng</language><subject>Mathematics - Combinatorics</subject><creationdate>2018-01</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1801.00474$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1801.00474$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>De Silva, Jessica</creatorcontrib><creatorcontrib>Si, Xiang</creatorcontrib><creatorcontrib>Tait, Michael</creatorcontrib><creatorcontrib>Tunçbilek, Yunus</creatorcontrib><creatorcontrib>Yang, Ruifan</creatorcontrib><creatorcontrib>Young, Michael</creatorcontrib><title>Anti-Ramsey Multiplicities</title><description>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 $H$ is called $r$-anti-common if the maximum proportion of rainbow copies of $H$ in any $r$-coloring of $E(K_n)$ is asymptotically achieved by taking a random coloring. In this paper, we investigate anti-Ramsey multiplicity for several families of graphs. We determine classes of graphs which are either anti-common or not. Some of these classes follow the same behavior as the monochromatic case, but some of them do not. In particular the rainbow equivalent of Sidorenko's conjecture, that all bipartite graphs are anti-common, is false.</description><subject>Mathematics - Combinatorics</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2018</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotzs0KgkAUhuHZtAjrAmpTN6DNGecnlyH9gRGEezkeZ2DAItQi776yVt_m5eNhbAY8kmul-Aqbl39GsOYQcS6NHLP55tb58ILX1vbL06Pu_L325Dtv2wkbOaxbO_1vwPLdNk8PYXbeH9NNFqI2MrRYknKJLoWoHCakYgnWOCW10ARxTEA2cZyssYSuMgQCwWmlNSROf_KALX63A664N_6KTV98kcWAjN9bnjal</recordid><startdate>20180101</startdate><enddate>20180101</enddate><creator>De Silva, Jessica</creator><creator>Si, Xiang</creator><creator>Tait, Michael</creator><creator>Tunçbilek, Yunus</creator><creator>Yang, Ruifan</creator><creator>Young, Michael</creator><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20180101</creationdate><title>Anti-Ramsey Multiplicities</title><author>De Silva, Jessica ; Si, Xiang ; Tait, Michael ; Tunçbilek, Yunus ; Yang, Ruifan ; Young, Michael</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a674-eabc5f96b22dfa9c5341e7f54626c133c1ce9f0ce7ecafd7c12a1f656619f6c53</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2018</creationdate><topic>Mathematics - Combinatorics</topic><toplevel>online_resources</toplevel><creatorcontrib>De Silva, Jessica</creatorcontrib><creatorcontrib>Si, Xiang</creatorcontrib><creatorcontrib>Tait, Michael</creatorcontrib><creatorcontrib>Tunçbilek, Yunus</creatorcontrib><creatorcontrib>Yang, Ruifan</creatorcontrib><creatorcontrib>Young, Michael</creatorcontrib><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>De Silva, Jessica</au><au>Si, Xiang</au><au>Tait, Michael</au><au>Tunçbilek, Yunus</au><au>Yang, Ruifan</au><au>Young, Michael</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Anti-Ramsey Multiplicities</atitle><date>2018-01-01</date><risdate>2018</risdate><abstract>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 $H$ is called $r$-anti-common if the maximum proportion of rainbow copies of $H$ in any $r$-coloring of $E(K_n)$ is asymptotically achieved by taking a random coloring. In this paper, we investigate anti-Ramsey multiplicity for several families of graphs. We determine classes of graphs which are either anti-common or not. Some of these classes follow the same behavior as the monochromatic case, but some of them do not. In particular the rainbow equivalent of Sidorenko's conjecture, that all bipartite graphs are anti-common, is false.</abstract><doi>10.48550/arxiv.1801.00474</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.1801.00474
ispartof
issn
language eng
recordid cdi_arxiv_primary_1801_00474
source arXiv.org
subjects Mathematics - Combinatorics
title Anti-Ramsey Multiplicities
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-25T06%3A40%3A31IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Anti-Ramsey%20Multiplicities&rft.au=De%20Silva,%20Jessica&rft.date=2018-01-01&rft_id=info:doi/10.48550/arxiv.1801.00474&rft_dat=%3Carxiv_GOX%3E1801_00474%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true