Berge cycles in non-uniform hypergraphs

Alexandr Kostochka; Ruth Luo; Zoltan Furedi

REVIEW

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2002.01597 v1 pith:IRT4KYFF submitted 2020-02-05 math.CO

Berge cycles in non-uniform hypergraphs

Zoltan Furedi , Alexandr Kostochka , Ruth Luo This is my paper

classification math.CO

keywords bergecyclesgivelongbestboundboundedcases

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

0 comments

read the original abstract

We consider two extremal problems for set systems without long Berge cycles. First we give Dirac-type minimum degree conditions that force long Berge cycles. Next we give an upper bound for the number of hyperedges in a hypergraph with bounded circumference. Both results are best possible in infinitely many cases.

Berge cycles in non-uniform hypergraphs

discussion (0)