{"title":"包含三角形的图形单色副本的性质","authors":"Hao Chen, Jie Ma","doi":"10.1137/23m1564894","DOIUrl":null,"url":null,"abstract":"SIAM Journal on Discrete Mathematics, Volume 38, Issue 1, Page 316-326, March 2024. <br/> Abstract. A graph [math] is called common and, respectively, strongly common if the number of monochromatic copies of [math] in a 2-edge-coloring [math] of a large clique is asymptotically minimized by the random coloring with an equal proportion of each color and, respectively, by the random coloring with the same proportion of each color as in [math]. A well-known theorem of Jagger, Št’ovíček, and Thomason states that every graph containing a [math] is not common. Here we prove an analogous result that every graph containing a [math] and with at least four edges is not strongly common.","PeriodicalId":49530,"journal":{"name":"SIAM Journal on Discrete Mathematics","volume":"7 1","pages":""},"PeriodicalIF":0.9000,"publicationDate":"2024-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Property on Monochromatic Copies of Graphs Containing a Triangle\",\"authors\":\"Hao Chen, Jie Ma\",\"doi\":\"10.1137/23m1564894\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"SIAM Journal on Discrete Mathematics, Volume 38, Issue 1, Page 316-326, March 2024. <br/> Abstract. A graph [math] is called common and, respectively, strongly common if the number of monochromatic copies of [math] in a 2-edge-coloring [math] of a large clique is asymptotically minimized by the random coloring with an equal proportion of each color and, respectively, by the random coloring with the same proportion of each color as in [math]. A well-known theorem of Jagger, Št’ovíček, and Thomason states that every graph containing a [math] is not common. Here we prove an analogous result that every graph containing a [math] and with at least four edges is not strongly common.\",\"PeriodicalId\":49530,\"journal\":{\"name\":\"SIAM Journal on Discrete Mathematics\",\"volume\":\"7 1\",\"pages\":\"\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2024-01-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SIAM Journal on Discrete Mathematics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1137/23m1564894\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIAM Journal on Discrete Mathematics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1137/23m1564894","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
A Property on Monochromatic Copies of Graphs Containing a Triangle
SIAM Journal on Discrete Mathematics, Volume 38, Issue 1, Page 316-326, March 2024. Abstract. A graph [math] is called common and, respectively, strongly common if the number of monochromatic copies of [math] in a 2-edge-coloring [math] of a large clique is asymptotically minimized by the random coloring with an equal proportion of each color and, respectively, by the random coloring with the same proportion of each color as in [math]. A well-known theorem of Jagger, Št’ovíček, and Thomason states that every graph containing a [math] is not common. Here we prove an analogous result that every graph containing a [math] and with at least four edges is not strongly common.
期刊介绍:
SIAM Journal on Discrete Mathematics (SIDMA) publishes research papers of exceptional quality in pure and applied discrete mathematics, broadly interpreted. The journal''s focus is primarily theoretical rather than empirical, but the editors welcome papers that evolve from or have potential application to real-world problems. Submissions must be clearly written and make a significant contribution.
Topics include but are not limited to:
properties of and extremal problems for discrete structures
combinatorial optimization, including approximation algorithms
algebraic and enumerative combinatorics
coding and information theory
additive, analytic combinatorics and number theory
combinatorial matrix theory and spectral graph theory
design and analysis of algorithms for discrete structures
discrete problems in computational complexity
discrete and computational geometry
discrete methods in computational biology, and bioinformatics
probabilistic methods and randomized algorithms.