Debsoumya Chakraborti, Jaehoon Kim, Hyunwoo Lee, Hong Liu, Jaehyeon Seo
{"title":"色临界图的彩虹极值问题","authors":"Debsoumya Chakraborti, Jaehoon Kim, Hyunwoo Lee, Hong Liu, Jaehyeon Seo","doi":"10.1002/rsa.21189","DOIUrl":null,"url":null,"abstract":"Abstract Given graphs over a common vertex set of size , what is the maximum value of having no “colorful” copy of , that is, a copy of containing at most one edge from each ? Keevash, Saks, Sudakov, and Verstraëte denoted this number as and completely determined for large . In fact, they showed that, depending on the value of , one of the two natural constructions is always the extremal construction. Moreover, they conjectured that the same holds for every color‐critical graphs, and proved it for 3‐color‐critical graphs. They also asked to classify the graphs that have only these two extremal constructions. We prove their conjecture for 4‐color‐critical graphs and for almost all ‐color‐critical graphs when . Moreover, we show that for every non‐color‐critical non‐bipartite graphs, none of the two natural constructions is extremal for certain values of .","PeriodicalId":54523,"journal":{"name":"Random Structures & Algorithms","volume":"153 2 1","pages":"0"},"PeriodicalIF":0.9000,"publicationDate":"2023-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"On a rainbow extremal problem for color‐critical graphs\",\"authors\":\"Debsoumya Chakraborti, Jaehoon Kim, Hyunwoo Lee, Hong Liu, Jaehyeon Seo\",\"doi\":\"10.1002/rsa.21189\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract Given graphs over a common vertex set of size , what is the maximum value of having no “colorful” copy of , that is, a copy of containing at most one edge from each ? Keevash, Saks, Sudakov, and Verstraëte denoted this number as and completely determined for large . In fact, they showed that, depending on the value of , one of the two natural constructions is always the extremal construction. Moreover, they conjectured that the same holds for every color‐critical graphs, and proved it for 3‐color‐critical graphs. They also asked to classify the graphs that have only these two extremal constructions. We prove their conjecture for 4‐color‐critical graphs and for almost all ‐color‐critical graphs when . Moreover, we show that for every non‐color‐critical non‐bipartite graphs, none of the two natural constructions is extremal for certain values of .\",\"PeriodicalId\":54523,\"journal\":{\"name\":\"Random Structures & Algorithms\",\"volume\":\"153 2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2023-10-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Random Structures & Algorithms\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1002/rsa.21189\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Random Structures & Algorithms","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1002/rsa.21189","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
On a rainbow extremal problem for color‐critical graphs
Abstract Given graphs over a common vertex set of size , what is the maximum value of having no “colorful” copy of , that is, a copy of containing at most one edge from each ? Keevash, Saks, Sudakov, and Verstraëte denoted this number as and completely determined for large . In fact, they showed that, depending on the value of , one of the two natural constructions is always the extremal construction. Moreover, they conjectured that the same holds for every color‐critical graphs, and proved it for 3‐color‐critical graphs. They also asked to classify the graphs that have only these two extremal constructions. We prove their conjecture for 4‐color‐critical graphs and for almost all ‐color‐critical graphs when . Moreover, we show that for every non‐color‐critical non‐bipartite graphs, none of the two natural constructions is extremal for certain values of .
期刊介绍:
It is the aim of this journal to meet two main objectives: to cover the latest research on discrete random structures, and to present applications of such research to problems in combinatorics and computer science. The goal is to provide a natural home for a significant body of current research, and a useful forum for ideas on future studies in randomness.
Results concerning random graphs, hypergraphs, matroids, trees, mappings, permutations, matrices, sets and orders, as well as stochastic graph processes and networks are presented with particular emphasis on the use of probabilistic methods in combinatorics as developed by Paul Erdõs. The journal focuses on probabilistic algorithms, average case analysis of deterministic algorithms, and applications of probabilistic methods to cryptography, data structures, searching and sorting. The journal also devotes space to such areas of probability theory as percolation, random walks and combinatorial aspects of probability.