Avoiding long Berge cycles

Z. Füredi, Alexandr Kostochka, Ruth Luo

Research output: Contribution to journalArticle

Abstract

Let n≥k≥r+3 and H be an n-vertex r-uniform hypergraph. We show that if |H|>[Formula presented](k−1r) then H contains a Berge cycle of length at least k. This bound is tight when k−2 divides n−1. We also show that the bound is attained only for connected r-uniform hypergraphs in which every block is the complete hypergraph Kk−1 (r).

Original languageEnglish
JournalJournal of Combinatorial Theory. Series B
DOIs
Publication statusAccepted/In press - Jan 1 2018

Fingerprint

Long Cycle
Uniform Hypergraph
Hypergraph
Divides
Cycle
Vertex of a graph

Keywords

  • Berge cycles
  • Extremal hypergraph theory

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics

Cite this

Avoiding long Berge cycles. / Füredi, Z.; Kostochka, Alexandr; Luo, Ruth.

In: Journal of Combinatorial Theory. Series B, 01.01.2018.

Research output: Contribution to journalArticle

@article{a546986a9b5d4da8ae1ec04ecbfbaef2,
title = "Avoiding long Berge cycles",
abstract = "Let n≥k≥r+3 and H be an n-vertex r-uniform hypergraph. We show that if |H|>[Formula presented](k−1r) then H contains a Berge cycle of length at least k. This bound is tight when k−2 divides n−1. We also show that the bound is attained only for connected r-uniform hypergraphs in which every block is the complete hypergraph Kk−1 (r).",
keywords = "Berge cycles, Extremal hypergraph theory",
author = "Z. F{\"u}redi and Alexandr Kostochka and Ruth Luo",
year = "2018",
month = "1",
day = "1",
doi = "10.1016/j.jctb.2018.12.001",
language = "English",
journal = "Journal of Combinatorial Theory. Series B",
issn = "0095-8956",
publisher = "Academic Press Inc.",

}

TY - JOUR

T1 - Avoiding long Berge cycles

AU - Füredi, Z.

AU - Kostochka, Alexandr

AU - Luo, Ruth

PY - 2018/1/1

Y1 - 2018/1/1

N2 - Let n≥k≥r+3 and H be an n-vertex r-uniform hypergraph. We show that if |H|>[Formula presented](k−1r) then H contains a Berge cycle of length at least k. This bound is tight when k−2 divides n−1. We also show that the bound is attained only for connected r-uniform hypergraphs in which every block is the complete hypergraph Kk−1 (r).

AB - Let n≥k≥r+3 and H be an n-vertex r-uniform hypergraph. We show that if |H|>[Formula presented](k−1r) then H contains a Berge cycle of length at least k. This bound is tight when k−2 divides n−1. We also show that the bound is attained only for connected r-uniform hypergraphs in which every block is the complete hypergraph Kk−1 (r).

KW - Berge cycles

KW - Extremal hypergraph theory

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

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

U2 - 10.1016/j.jctb.2018.12.001

DO - 10.1016/j.jctb.2018.12.001

M3 - Article

JO - Journal of Combinatorial Theory. Series B

JF - Journal of Combinatorial Theory. Series B

SN - 0095-8956

ER -