2020/06/30 by Sylwia Antoniuk, Antoniuk, Sylwia, Nina Kamčev +3
Engineering · Mathematics · Neuroscience · #05C45 #05C65 #05D40 #Combinatorics (math.CO) #FOS: Mathematics #Limits and Structures in Graph Theory #Nuclear Receptors and Signaling #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.2006.16544
openalex publication_date 2020/06/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We consider a robust variant of Dirac-type problems in k-uniform hypergraphs. For instance, we prove that if H is a k-uniform hypergraph with minimum codegree at least (1/2 + γ)n, γ>0, and n is sufficiently large, then any edge coloring ϕ satisfying appropriate local constraints yields a properly colored tight Hamilton cycle in H. Similar results for loose cycles are also shown.