报告题目：An approximate Ore-type theorem for $\ell$-Hamilton cycles in k-uniform hypergraphs

报告简介：A classic result of Ore states that if the degree sum of any two independent vertices in an n-vertex graph is at least n, then the graph contains a Hamiltonian cycle. In this talk, we consider the generation of the Ore’s theorem to $\ell$-Hamilton cycles in k-uniform hypergraphs. The key idea is a modification of the absorbing lemma.

报告人：蒋太江，贵州大学博士，主要研究方向是超图的哈密顿圈分解，Dirac定理在超图中的推广。在Discrete Applied Mathematics,Discrete Mathematics等期刊发表论文数篇。

报告时间：2022年11月19日（星期六） 19:00-21:00.

报告地点：腾讯会议，ID：792 988 491

主办单位：扬州大学数学科学学院

欢迎广大师生参加！