On 3-uniform hypergraphs avoiding a cycle of length four

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

doi:10.37236/11443

On 3-uniform hypergraphs avoiding a cycle of length four

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

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

Abstract

We show that the maximum number of edges in a 3-uniform n-vertex hypergraph without a Berge cycle of length four is at most [Formula Presented]. This improves earlier estimates by Győri and Lemons, and by Füredi and Özkahya.

Original language	English
Article number	#P4.5
Pages (from-to)	4-5
Number of pages	2
Journal	Electronic Journal of Combinatorics
Volume	30
Issue number	4
DOIs	https://doi.org/10.37236/11443
State	Published - 2023

Bibliographical note

Publisher Copyright:
© The authors.

ASJC Scopus subject areas

Theoretical Computer Science
Geometry and Topology
Discrete Mathematics and Combinatorics
Computational Theory and Mathematics
Applied Mathematics

Access to Document

10.37236/11443

Cite this

@article{9b2aa80e1acb4e22873716d25989b5c2,

title = "On 3-uniform hypergraphs avoiding a cycle of length four",

abstract = "We show that the maximum number of edges in a 3-uniform n-vertex hypergraph without a Berge cycle of length four is at most [Formula Presented]. This improves earlier estimates by Gy{\H o}ri and Lemons, and by F{\"u}redi and {\"O}zkahya.",

author = "Beka Ergemlidze and Ervin Gy{\H o}ri and Abhishek Methuku and Nika Salia and Casey Tompkins",

note = "Publisher Copyright: {\textcopyright} The authors.",

year = "2023",

doi = "10.37236/11443",

language = "English",

volume = "30",

pages = "4--5",

journal = "Electronic Journal of Combinatorics",

issn = "1077-8926",

number = "4",

}

TY - JOUR

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

AU - Ergemlidze, Beka

AU - Győri, Ervin

AU - Methuku, Abhishek

AU - Salia, Nika

AU - Tompkins, Casey

N1 - Publisher Copyright: © The authors.

PY - 2023

Y1 - 2023

N2 - We show that the maximum number of edges in a 3-uniform n-vertex hypergraph without a Berge cycle of length four is at most [Formula Presented]. This improves earlier estimates by Győri and Lemons, and by Füredi and Özkahya.

AB - We show that the maximum number of edges in a 3-uniform n-vertex hypergraph without a Berge cycle of length four is at most [Formula Presented]. This improves earlier estimates by Győri and Lemons, and by Füredi and Özkahya.

UR - http://www.scopus.com/inward/record.url?scp=85173787358&partnerID=8YFLogxK

U2 - 10.37236/11443

DO - 10.37236/11443

M3 - Article

AN - SCOPUS:85173787358

SN - 1077-8926

VL - 30

SP - 4

EP - 5

JO - Electronic Journal of Combinatorics

JF - Electronic Journal of Combinatorics

IS - 4

M1 - #P4.5

ER -

On 3-uniform hypergraphs avoiding a cycle of length four

Abstract

Bibliographical note

ASJC Scopus subject areas

Access to Document

Fingerprint

Cite this