甬江数学讲坛606讲(明理数学大讲堂之数学讲座2026年第51讲)-Tight Hamilton Cycles in Linearly Quasirandom 3-Graphs
2026-11-09 16:13
阅读次数:

报告时间:2026年11月10日 19:30开始

报 告 人:舒希超(Leipzig University)

报告地点:腾讯会议:432-878-352

报告题目:Tight Hamilton Cycles in Linearly Quasirandom 3-Graphs

报告摘要:We study tight Hamilton cycles in linearly quasirandom 3-uniform hypergraphs. Ara\'ujo, Piga and Schacht asked whether density $p>1/4$, together with minimum codegree greater than $n/4$, is sufficient to force a tight Hamilton cycle. We give a negative answer to this question and, more generally, determine the asymptotically sharp minimum-codegree threshold for every density $p\in(0,1)$. The resulting threshold is a discontinuous piecewise-defined function with four distinct regimes, and matching constructions show that each part is best possible. The proof combines the absorption method with connecting arguments and a canonical-component Hamilton framework.

报告人简介:舒希超,德国莱比锡大学(Leipzig University)博士研究生,导师为 Daniel Král'教授。他硕士毕业于山东大学,师从王光辉教授,随后进入马萨里克大学(Masaryk University)攻读博士学位,并于2025年转至莱比锡大学继续深造。他的研究方向主要包括极值组合学、图极限和几何极值问题,研究成果发表于 JCTB、SODA、SIDMA 等国际知名期刊和会议。

【关闭】