On the Turán Density of Uniform Hypergraphs

Pub Date : 2023-06-17 DOI:10.1007/s10255-023-1067-2
An Chang, Guo-rong Gao
{"title":"On the Turán Density of Uniform Hypergraphs","authors":"An Chang,&nbsp;Guo-rong Gao","doi":"10.1007/s10255-023-1067-2","DOIUrl":null,"url":null,"abstract":"<div><p>Let <i>p, q</i> be two positive integers. The 3-graph <i>F</i>(<i>p, q</i>) is obtained from the complete 3-graph <i>K</i><span>\n <sup>3</sup><sub><i>p</i></sub>\n \n </span> by adding <i>q</i> new vertices and <span>\\(p(_2^q)\\)</span> new edges of the form <i>vxy</i> for which <i>v</i> ∈ <i>V</i>(<i>K</i><span>\n <sup>3</sup><sub><i>p</i></sub>\n \n </span>) and {<i>x, y</i>} are new vertices. It frequently appears in many literatures on the Turán number or Turán density of hypergraphs. In this paper, we first construct a new class of <i>r</i>-graphs which can be regarded as a generalization of the 3-graph <i>F</i>(<i>p, q</i>), and prove that these <i>r</i>-graphs have the same Turán density under some situations. Moreover, we investigate the Turán density of the <i>F</i>(<i>p, q</i>) for small <i>p, q</i> and obtain some new bounds on their Turán densities.</p></div>","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://link.springer.com/article/10.1007/s10255-023-1067-2","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Let p, q be two positive integers. The 3-graph F(p, q) is obtained from the complete 3-graph K 3p by adding q new vertices and \(p(_2^q)\) new edges of the form vxy for which vV(K 3p ) and {x, y} are new vertices. It frequently appears in many literatures on the Turán number or Turán density of hypergraphs. In this paper, we first construct a new class of r-graphs which can be regarded as a generalization of the 3-graph F(p, q), and prove that these r-graphs have the same Turán density under some situations. Moreover, we investigate the Turán density of the F(p, q) for small p, q and obtain some new bounds on their Turán densities.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
关于一致超图的Turán密度
设p,q是两个正整数。3图F(p,q)是由完备的3图K3p通过添加形式vxy的q个新顶点和\(p(2^q)\)个新边得到的,其中v∈v(K3p)和{x,y}是新顶点。它经常出现在许多关于超图的图兰数或图兰密度的文献中。本文首先构造了一类新的r图,它可以看作是3-图F(p,q)的推广,并证明了这些r图在某些情况下具有相同的Turán密度。此外,我们还研究了小p,q的F(p,q)的Turán密度,并得到了它们的Turón密度的一些新的界。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
×
引用
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