An oriented discrepancy version of Dirac's theorem

IF 1.2 1区 数学 Q1 MATHEMATICS
Andrea Freschi, Allan Lo
{"title":"An oriented discrepancy version of Dirac's theorem","authors":"Andrea Freschi,&nbsp;Allan Lo","doi":"10.1016/j.jctb.2024.06.008","DOIUrl":null,"url":null,"abstract":"<div><p>The study of graph discrepancy problems, initiated by Erdős in the 1960s, has received renewed attention in recent years. In general, given a 2-edge-coloured graph <em>G</em>, one is interested in embedding a copy of a graph <em>H</em> in <em>G</em> with large discrepancy (i.e. the copy of <em>H</em> contains significantly more than half of its edges in one colour).</p><p>Motivated by this line of research, Gishboliner, Krivelevich and Michaeli considered an oriented version of graph discrepancy for Hamilton cycles. In particular, they conjectured the following generalisation of Dirac's theorem: if <em>G</em> is an oriented graph on <span><math><mi>n</mi><mo>≥</mo><mn>3</mn></math></span> vertices with <span><math><mi>δ</mi><mo>(</mo><mi>G</mi><mo>)</mo><mo>≥</mo><mi>n</mi><mo>/</mo><mn>2</mn></math></span>, then <em>G</em> contains a Hamilton cycle with at least <span><math><mi>δ</mi><mo>(</mo><mi>G</mi><mo>)</mo></math></span> edges pointing forwards. In this paper, we present a full resolution to this conjecture.</p></div>","PeriodicalId":54865,"journal":{"name":"Journal of Combinatorial Theory Series B","volume":"169 ","pages":"Pages 338-351"},"PeriodicalIF":1.2000,"publicationDate":"2024-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0095895624000571/pdfft?md5=c4578c27cd9e214edf177c194b1972bb&pid=1-s2.0-S0095895624000571-main.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Theory Series B","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0095895624000571","RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

The study of graph discrepancy problems, initiated by Erdős in the 1960s, has received renewed attention in recent years. In general, given a 2-edge-coloured graph G, one is interested in embedding a copy of a graph H in G with large discrepancy (i.e. the copy of H contains significantly more than half of its edges in one colour).

Motivated by this line of research, Gishboliner, Krivelevich and Michaeli considered an oriented version of graph discrepancy for Hamilton cycles. In particular, they conjectured the following generalisation of Dirac's theorem: if G is an oriented graph on n3 vertices with δ(G)n/2, then G contains a Hamilton cycle with at least δ(G) edges pointing forwards. In this paper, we present a full resolution to this conjecture.

狄拉克定理的定向差异版本
图差异问题的研究由 Erdős 在 20 世纪 60 年代发起,近年来再次受到关注。一般来说,给定一个两边着色的图 G,人们感兴趣的是在 G 中嵌入一个具有较大差异的图 H 副本(即 H 副本含有明显超过一半的边为一种颜色)。特别是,他们猜想了狄拉克定理的以下概括:如果 G 是 n≥3 个顶点上的δ(G)≥n/2 的定向图,那么 G 包含一个至少有 δ(G) 条边指向前方的汉密尔顿循环。在本文中,我们提出了这一猜想的完整解决方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
2.70
自引率
14.30%
发文量
99
审稿时长
6-12 weeks
期刊介绍: The Journal of Combinatorial Theory publishes original mathematical research dealing with theoretical and physical aspects of the study of finite and discrete structures in all branches of science. Series B is concerned primarily with graph theory and matroid theory and is a valuable tool for mathematicians and computer scientists.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信