Longest cycles in 3-connected hypergraphs and bipartite graphs
Combinatorics
2020-04-20 v1
Abstract
In the language of hypergraphs, our main result is a Dirac-type bound: we prove that every -connected hypergraph with 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.
Keywords
Cite
@article{arxiv.2004.08291,
title = {Longest cycles in 3-connected hypergraphs and bipartite graphs},
author = {Alexandr Kostochka and Mikhail Lavrov and Ruth Luo and Dara Zirlin},
journal= {arXiv preprint arXiv:2004.08291},
year = {2020}
}