首页|Minimum pair degree condition for tight Hamiltonian cycles in $4$-uniform hypergraphs

Minimum pair degree condition for tight Hamiltonian cycles in $4$-uniform hypergraphs

来源：

英文摘要

We show that every 4-uniform hypergraph with $n$ vertices and minimum pair degree at least $(5/9+o(1))n^2/2$ contains a tight Hamiltonian cycle. This degree condition is asymptotically optimal.

作者：Bjarne Sch¨1lke、Joanna Polcyn、Andrzej Ruci¨?ski、Christian Reiher、Vojt¨§ch R?dl、Mathias Schacht

作者单位：

DOI：10.1007/s10474-020-01078-7

学科分类：数学

推荐引用：Bjarne Sch¨1lke,Joanna Polcyn,Andrzej Ruci¨?ski,Christian Reiher,Vojt¨§ch R?dl,Mathias Schacht.Minimum pair degree condition for tight Hamiltonian cycles in $4$-uniform hypergraphs[EB/OL].(2020-05-07)[2025-08-02].https://arxiv.org/abs/2005.03391.点此复制

Minimum pair degree condition for tight Hamiltonian cycles in $4$-uniform hypergraphs

Minimum pair degree condition for tight Hamiltonian cycles in $4$-uniform hypergraphs

评论