The codegree Turán density of 3-uniform tight cycles

IF 1.2 1区数学 Q1 MATHEMATICS

Journal of Combinatorial Theory Series B Pub Date : 2025-08-07 DOI:10.1016/j.jctb.2025.07.007

Simón Piga, Nicolás Sanhueza-Matamala, Mathias Schacht

引用次数: 0

Abstract

Given any ε>0 we prove that every sufficiently large n-vertex 3-graph H where every pair of vertices is contained in at least (1/3+ε)n edges contains a copy of C10, i.e. the tight cycle on 10 vertices. In fact we obtain the same conclusion for every cycle Cℓ with ℓ≥19.

查看原文本刊更多论文

3均匀紧循环的余度Turán密度

给定任意ε>；0，我们证明了每一个足够大的n顶点3-图H，其中每一对顶点至少包含（1/3+ε）n条边，其中包含C10的一个副本，即10个顶点上的紧环。事实上，对于每一个循环，我们都得到了相同的结论。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Journal of Combinatorial Theory Series B 数学-数学

CiteScore

2.70

自引率

14.30%

发文量

审稿时长

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.