Properly Colored Hamilton Cycles in Dirac-Type Hypergraphs

[摘要] 0$, and $n$ is sufficiently large, then any edge coloring $\phi$ satisfying appropriate local constraints yields a properly colored tight Hamilton cycle in $\mathcal{H}$. Similar results for loose cycles are also shown.

[学科分类] 统计和概率