HYPERGRAPHS WITH NO TIGHT CYCLES

被引：7

作者：

Letzter, Shoham ^{[1
]}

机构：

[1] UCL, Dept Math, Gower St, London WC1E 6BT, England

来源：

PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY | 2023年 / 151卷 / 02期

关键词：

D O I：

10.1090/proc/16043

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

We show that every r-uniform hypergraph on n vertices which does not contain a tight cycle has at most O(nr-1(log n)5) edges. This is an improvement on the previously best-known bound, of nr-1eO(root log n), due to Sudakov and Tomon, and our proof builds on their work. A recent construction of B. Janzer implies that our bound is tight up to an O((log n)4 log log n) factor.

引用

收藏

页码：455 / 462

页数：8

相关论文

共 15 条

[1] Tight cycles and regular slices in dense hypergraphs [J].

Allen, Peter ;

Bottcher, Julia ;

Cooley, Oliver ;

Mycroft, Richard .

JOURNAL OF COMBINATORIAL THEORY SERIES A, 2017, 149 :30-100

[2] ON EXTREMAL PROBLEMS OF GRAPHS AND GENERALIZED GRAPHS [J].

ERDOS, P .

ISRAEL JOURNAL OF MATHEMATICS, 1964, 2 (03) :183-&

[3] EXACT SOLUTION OF SOME TURAN-TYPE PROBLEMS [J].

FRANKL, P ;

FUREDI, Z .

JOURNAL OF COMBINATORIAL THEORY SERIES A, 1987, 45 (02) :226-262

[4] Hypergraph Turan numbers of linear cycles [J].

Fueredi, Zoltan ;

Jiang, Tao .

JOURNAL OF COMBINATORIAL THEORY SERIES A, 2014, 123 (01) :252-270

[5] 3-uniform hypergraphs avoiding a given odd cycle [J].

Gyori, Ervin ;

Lemons, Nathan .

COMBINATORICA, 2012, 32 (02) :187-203

[6] Hypergraphs with No Cycle of a Given Length [J].

Gyori, Ervin ;

Lemons, Nathan .

COMBINATORICS PROBABILITY & COMPUTING, 2012, 21 (1-2) :193-201

[7] ON TIGHT CYCLES IN HYPERGRAPHS [J].

Huang, Hao ;

Ma, Jie .

SIAM JOURNAL ON DISCRETE MATHEMATICS, 2019, 33 (01) :230-237

[8]

Janzer Barnabas, 2021, COMB THEORY, V1, DOI 10.5070/C61055374

[9]

Jiang T., 2020, ARXIV

[10] Cycles of given lengths in hypergraphs [J].

Jiang, Tao ;

Ma, Jie .

JOURNAL OF COMBINATORIAL THEORY SERIES B, 2018, 133 :54-77