Common graphs with arbitrary connectivity and chromatic number

IF 16.4 1区 化学 Q1 CHEMISTRY, MULTIDISCIPLINARY Accounts of Chemical Research Pub Date : 2023-09-01 DOI:10.1016/j.jctb.2023.06.001
Sejin Ko , Joonkyung Lee
{"title":"Common graphs with arbitrary connectivity and chromatic number","authors":"Sejin Ko ,&nbsp;Joonkyung Lee","doi":"10.1016/j.jctb.2023.06.001","DOIUrl":null,"url":null,"abstract":"<div><p>A graph <em>H</em> is <em>common</em> if the number of monochromatic copies of <em>H</em> in a 2-edge-colouring of the complete graph <span><math><msub><mrow><mi>K</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span> is asymptotically minimised by the random colouring. We prove that, given <span><math><mi>k</mi><mo>,</mo><mi>r</mi><mo>&gt;</mo><mn>0</mn></math></span>, there exists a <em>k</em><span>-connected common graph with chromatic number at least </span><em>r</em>. The result is built upon the recent breakthrough of Kráľ, Volec, and Wei who obtained common graphs with arbitrarily large chromatic number and answers a question of theirs.</p></div>","PeriodicalId":1,"journal":{"name":"Accounts of Chemical Research","volume":null,"pages":null},"PeriodicalIF":16.4000,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Accounts of Chemical Research","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S009589562300045X","RegionNum":1,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 6

Abstract

A graph H is common if the number of monochromatic copies of H in a 2-edge-colouring of the complete graph Kn is asymptotically minimised by the random colouring. We prove that, given k,r>0, there exists a k-connected common graph with chromatic number at least r. The result is built upon the recent breakthrough of Kráľ, Volec, and Wei who obtained common graphs with arbitrarily large chromatic number and answers a question of theirs.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
具有任意连通性和色数的公共图
如果完整图Kn的2-色中H的单色副本的数量通过随机着色渐近最小化,则图H是常见的。我们证明,给定k,r>;0,存在一个色数至少为r的k-连通公共图。该结果建立在Kráľ、Volec和Wei最近的突破之上,他们获得了任意大色数的公共图,并回答了他们的一个问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Accounts of Chemical Research
Accounts of Chemical Research 化学-化学综合
CiteScore
31.40
自引率
1.10%
发文量
312
审稿时长
2 months
期刊介绍: Accounts of Chemical Research presents short, concise and critical articles offering easy-to-read overviews of basic research and applications in all areas of chemistry and biochemistry. These short reviews focus on research from the author’s own laboratory and are designed to teach the reader about a research project. In addition, Accounts of Chemical Research publishes commentaries that give an informed opinion on a current research problem. Special Issues online are devoted to a single topic of unusual activity and significance. Accounts of Chemical Research replaces the traditional article abstract with an article "Conspectus." These entries synopsize the research affording the reader a closer look at the content and significance of an article. Through this provision of a more detailed description of the article contents, the Conspectus enhances the article's discoverability by search engines and the exposure for the research.
期刊最新文献
Management of Cholesteatoma: Hearing Rehabilitation. Congenital Cholesteatoma. Evaluation of Cholesteatoma. Management of Cholesteatoma: Extension Beyond Middle Ear/Mastoid. Recidivism and Recurrence.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1