József Balogh, Anita Liebenau, Letícia Mattos, Natasha Morrison
{"title":"On Multicolor Turán Numbers","authors":"József Balogh, Anita Liebenau, Letícia Mattos, Natasha Morrison","doi":"10.1137/24m1639488","DOIUrl":null,"url":null,"abstract":"SIAM Journal on Discrete Mathematics, Volume 38, Issue 3, Page 2297-2311, September 2024. <br/> Abstract. We address a problem which is a generalization of Turán-type problems recently introduced by Imolay, Karl, Nagy, and Váli. Let [math] be a fixed graph and let [math] be the union of [math] edge-disjoint copies of [math], namely [math], where each [math] is isomorphic to a fixed graph [math] and [math] for all [math]. We call a subgraph [math] multicolored if [math] and [math] share at most one edge for all [math]. Define [math] to be the maximum value [math] such that there exists [math] on [math] vertices without a multicolored copy of [math]. We show that [math] and that all extremal graphs are close to a blow-up of the 5-cycle. This bound is tight up to the linear error term.","PeriodicalId":49530,"journal":{"name":"SIAM Journal on Discrete Mathematics","volume":"8 1","pages":""},"PeriodicalIF":0.9000,"publicationDate":"2024-08-26","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/24m1639488","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
SIAM Journal on Discrete Mathematics, Volume 38, Issue 3, Page 2297-2311, September 2024. Abstract. We address a problem which is a generalization of Turán-type problems recently introduced by Imolay, Karl, Nagy, and Váli. Let [math] be a fixed graph and let [math] be the union of [math] edge-disjoint copies of [math], namely [math], where each [math] is isomorphic to a fixed graph [math] and [math] for all [math]. We call a subgraph [math] multicolored if [math] and [math] share at most one edge for all [math]. Define [math] to be the maximum value [math] such that there exists [math] on [math] vertices without a multicolored copy of [math]. We show that [math] and that all extremal graphs are close to a blow-up of the 5-cycle. This bound is tight up to the linear error term.
期刊介绍:
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.