On $3$-uniform hypergraphs avoiding a cycle of length four

IF 0.7 4区数学 Q2 MATHEMATICS

Electronic Journal of Combinatorics Pub Date : 2023-10-06 DOI:10.37236/11443

Beka Ergemlidze, Ervin Győri, Abhishek Methuku, Nika Salia, Casey Tompkins

引用次数: 5

Abstract

We show that the maximum number of edges in a $3$-uniform hypergraph without a Berge cycle of length four is at most $(1+o(1))\frac{n^{3/2}}{\sqrt{10}}$. This improves earlier estimates by Győri and Lemons and by Füredi and Özkahya.

查看原文本刊更多论文

在$3$均匀超图上，避免了一个长度为4的循环

我们证明了不存在长度为4的Berge循环的$3$ -一致超图的最大边数不超过$(1+o(1))\frac{n^{3/2}}{\sqrt{10}}$。这改进了Győri和Lemons以及f redi和Özkahya先前的估计。

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

求助全文

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

来源期刊

Electronic Journal of Combinatorics 数学-数学

CiteScore

1.30

自引率

14.30%

发文量

212

审稿时长

3-6 weeks

期刊介绍： The Electronic Journal of Combinatorics (E-JC) is a fully-refereed electronic journal with very high standards, publishing papers of substantial content and interest in all branches of discrete mathematics, including combinatorics, graph theory, and algorithms for combinatorial problems.