Pith. sign in

REVIEW

Longest cycles in 3-connected hypergraphs and bipartite graphs

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 2004.08291 v1 pith:H33PPWP7 submitted 2020-04-17 math.CO

Alexandr Kostochka , Mikhail Lavrov , Ruth Luo , Dara Zirlin This is my paper · ORCID
classification math.CO
keywords bipartitegraphslanguageconnectedhypergraphhypergraphsbergebound
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

In the language of hypergraphs, our main result is a Dirac-type bound: we prove that every $3$-connected hypergraph $H$ with $ \delta(H)\geq \max\{|V(H)|, \frac{|E(H)|+10}{4}\}$ has a hamiltonian Berge cycle. This is sharp and refines a conjecture by Jackson from 1981 (in the language of bipartite graphs). Our proofs are in the language of bipartite graphs, since the incidence graph of each hypergraph is bipartite.

Discussion (0). Continue with ORCID to comment.

Pith tools