Connected hypergraphs without long Berge-paths

Ervin Győri; Nika Salia; Oscar Zamora

doi:10.1016/j.ejc.2021.103353

Connected hypergraphs without long Berge-paths

Ervin Győri
, Nika Salia
, Oscar Zamora

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

6 Scopus citations

Abstract

We generalize a result of Balister, Győri, Lehel and Schelp for hypergraphs. We determine the unique extremal structure of an n-vertex r-uniform connected hypergraph with the maximum number of hyperedges, without a k-Berge-path, where n≥N_k,r, k≥2r+13>17.

Original language	English
Article number	103353
Journal	European Journal of Combinatorics
Volume	96
DOIs	https://doi.org/10.1016/j.ejc.2021.103353
State	Published - Aug 2021
Externally published	Yes

Bibliographical note

Publisher Copyright:
© 2021 The Author(s)

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics

Access to Document

10.1016/j.ejc.2021.103353

Cite this

@article{19ea8a988ffd436eb3075667dd0e6590,

title = "Connected hypergraphs without long Berge-paths",

abstract = "We generalize a result of Balister, Gy{\H o}ri, Lehel and Schelp for hypergraphs. We determine the unique extremal structure of an n-vertex r-uniform connected hypergraph with the maximum number of hyperedges, without a k-Berge-path, where n≥Nk,r, k≥2r+13>17.",

author = "Ervin Gy{\H o}ri and Nika Salia and Oscar Zamora",

note = "Publisher Copyright: {\textcopyright} 2021 The Author(s)",

year = "2021",

month = aug,

doi = "10.1016/j.ejc.2021.103353",

language = "English",

volume = "96",

journal = "European Journal of Combinatorics",

issn = "0195-6698",

publisher = "Academic Press",

}

TY - JOUR

T1 - Connected hypergraphs without long Berge-paths

AU - Győri, Ervin

AU - Salia, Nika

AU - Zamora, Oscar

PY - 2021/8

Y1 - 2021/8

N2 - We generalize a result of Balister, Győri, Lehel and Schelp for hypergraphs. We determine the unique extremal structure of an n-vertex r-uniform connected hypergraph with the maximum number of hyperedges, without a k-Berge-path, where n≥Nk,r, k≥2r+13>17.

AB - We generalize a result of Balister, Győri, Lehel and Schelp for hypergraphs. We determine the unique extremal structure of an n-vertex r-uniform connected hypergraph with the maximum number of hyperedges, without a k-Berge-path, where n≥Nk,r, k≥2r+13>17.

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

U2 - 10.1016/j.ejc.2021.103353

DO - 10.1016/j.ejc.2021.103353

M3 - Article

AN - SCOPUS:85105349713

SN - 0195-6698

VL - 96

JO - European Journal of Combinatorics

JF - European Journal of Combinatorics

M1 - 103353

ER -

Connected hypergraphs without long Berge-paths

Abstract

Bibliographical note

ASJC Scopus subject areas

Access to Document

Fingerprint

Cite this