The structure of hypergraphs without long berge cycles

E. Győri; N. Lemons; N. Salia; O. Zamora

The structure of hypergraphs without long berge cycles

E. Győri
, N. Lemons
, N. Salia
, O. Zamora

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

Abstract

We study the structure of r-uniform hypergraphs containing no Berge cycles of length at least k for k ≤ r, and determine that such hypergraphs have some special substructure. In particular we determine the extremal number of such hypergraphs, giving an affirmative answer to the conjectured value when k = r and giving a a simple solution to a recent result of Kostochka-Luo when k < r.

Original language	English
Pages (from-to)	767-771
Number of pages	5
Journal	Acta Mathematica Universitatis Comenianae
Volume	88
Issue number	3
State	Published - 2 Sep 2019
Externally published	Yes

Bibliographical note

Publisher Copyright:
© 2019, Univerzita Komenskeho. All rights reserved.

ASJC Scopus subject areas

General Mathematics

Cite this

@article{9730c81d43d8458984c11062fd828b92,

title = "The structure of hypergraphs without long berge cycles",

abstract = "We study the structure of r-uniform hypergraphs containing no Berge cycles of length at least k for k ≤ r, and determine that such hypergraphs have some special substructure. In particular we determine the extremal number of such hypergraphs, giving an affirmative answer to the conjectured value when k = r and giving a a simple solution to a recent result of Kostochka-Luo when k < r.",

author = "E. Gy{\H o}ri and N. Lemons and N. Salia and O. Zamora",

year = "2019",

month = sep,

day = "2",

language = "English",

volume = "88",

pages = "767--771",

journal = "Acta Mathematica Universitatis Comenianae",

issn = "0862-9544",

publisher = "Comenius University in Bratislava",

number = "3",

}

TY - JOUR

T1 - The structure of hypergraphs without long berge cycles

AU - Győri, E.

AU - Lemons, N.

AU - Salia, N.

AU - Zamora, O.

PY - 2019/9/2

Y1 - 2019/9/2

N2 - We study the structure of r-uniform hypergraphs containing no Berge cycles of length at least k for k ≤ r, and determine that such hypergraphs have some special substructure. In particular we determine the extremal number of such hypergraphs, giving an affirmative answer to the conjectured value when k = r and giving a a simple solution to a recent result of Kostochka-Luo when k < r.

AB - We study the structure of r-uniform hypergraphs containing no Berge cycles of length at least k for k ≤ r, and determine that such hypergraphs have some special substructure. In particular we determine the extremal number of such hypergraphs, giving an affirmative answer to the conjectured value when k = r and giving a a simple solution to a recent result of Kostochka-Luo when k < r.

UR - https://www.scopus.com/pages/publications/85073800322

M3 - Article

AN - SCOPUS:85073800322

SN - 0862-9544

VL - 88

SP - 767

EP - 771

JO - Acta Mathematica Universitatis Comenianae

JF - Acta Mathematica Universitatis Comenianae

IS - 3

ER -

The structure of hypergraphs without long berge cycles

Abstract

Bibliographical note

ASJC Scopus subject areas

Fingerprint

Cite this