Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs
| العنوان: | Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs |
|---|---|
| المؤلفون: | Elad Aigner-Horev, Gil Levy |
| المصدر: | Combinatorics, Probability and Computing. 30:412-443 |
| بيانات النشر: | Cambridge University Press (CUP), 2020. |
| سنة النشر: | 2020 |
| مصطلحات موضوعية: | Statistics and Probability, Applied Mathematics, 010102 general mathematics, 0102 computer and information sciences, 01 natural sciences, Hamiltonian path, Theoretical Computer Science, Combinatorics, symbols.namesake, Computational Theory and Mathematics, 010201 computation theory & mathematics, symbols, Order (group theory), 0101 mathematics, Mathematics |
| الوصف: | We employ the absorbing-path method in order to prove two results regarding the emergence of tight Hamilton cycles in the so-called two-path or cherry-quasirandom 3-graphs.Our first result asserts that for any fixed real α > 0, cherry-quasirandom 3-graphs of sufficiently large order n having minimum 2-degree at least α(n – 2) have a tight Hamilton cycle.Our second result concerns the minimum 1-degree sufficient for such 3-graphs to have a tight Hamilton cycle. Roughly speaking, we prove that for every d, α > 0 satisfying d + α > 1, any sufficiently large n-vertex such 3-graph H of density d and minimum 1-degree at least $\alpha \left({\matrix{{n - 1} \cr 2 \cr } } \right)$ has a tight Hamilton cycle. |
| تدمد: | 1469-2163 0963-5483 |
| URL الوصول: | https://explore.openaire.eu/search/publication?articleId=doi_________::d52c1a269c97010cf3445ec928faf953 https://doi.org/10.1017/s0963548320000486 |
| حقوق: | OPEN |
| رقم الأكسشن: | edsair.doi...........d52c1a269c97010cf3445ec928faf953 |
| قاعدة البيانات: | OpenAIRE |
| تدمد: | 14692163 09635483 |
|---|