加载中…
A Berge cycle of length in a hypergraph is a sequence of distinct vertices and hyperedges such that for all , indices taken modulo . F"uredi, Kostochka and Luo recently gave sharp Dirac-type minimum degree conditions that force non-uniform hypergraphs to have Hamiltonian Berge cycles. We give a sharp P'osa-type lower bound for -uniform and non-uniform hypergraphs that force Hamiltonian Berge cycles.

生成讲解博客的中文版本

生成AI智能校验的中文版本