Longest cycles in 3-connected hypergraphs and bipartite graphs
Department
Mathematics
Document Type
Article
Publication Date
4-1-2022
Abstract
In the language of hypergraphs, our main result is a Dirac-type bound: We prove that every 3-connected hypergraph (Formula presented.) with (Formula presented.) 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.
Journal Title
Journal of Graph Theory
Journal ISSN
03649024
Volume
99
Issue
4
First Page
758
Last Page
782
Digital Object Identifier (DOI)
10.1002/jgt.22762
COinS