您的位置: long8国际唯一官网 > 资源和办公 > 新闻中心 > 学术报告


2019年12月11日 15:59  点击:[]

讲座题目 On the potential function of an arbitrary graph H 讲座时间 2019年12月14日15:00-16:00
讲座地点 九号楼七层学术报告厅 主讲人 尹建华教授
内容摘要 Given a graph H, a graphic sequence \pi is potentially H- graphic if there is a realization of \pi containing H as a subgraph. In 1991, Erdos, Jacobson and Lehel introduced the following problem: determine the minimum even integer \sg(H,n) such that each n-term graphic sequence with sum at least \sg(H,n) is potentially H-graphic. This problem can be viewed as a ``potential" degree sequence relaxation of the Turan problems. For an arbitrary graph H of order k, Ferrara et al. established an upper bound on \sg(H,n) as follows: If \omega=\omega(n) be an increasing function that tends to infinity with n, then there exists an N=N(\omega,H) such that \sg(H,n)\le \widetilde{\sg}(H)n +\omega(n) for any n\ge N, where \widetilde{\sg}(H) is a parameter only depending on the graph H. We obtain a new upper bound on \sg(H,n) so that \omega(n)=k^2-3k+4, that is, there exists an M=M(k,\alpha(H)) such that \sg(H,n)\le \widetilde{\sg}(H)n+k^2 -3k+4 for any n\ge M. 主讲简介 尹建华,海南大学数学系教授,硕士生导师。主要研究方向为图论及其应用。先后主持自然科学基金项目多项,发表论文数十篇。

上一条:侯耀平教授学术讲座预告 下一条:李红海教授学术讲座预告



long8国际唯一官网:FAST TRACK

  • 数字校园
  • 电子校历
  • 课表查询
  • 成绩录入
  • 成绩查询
  • 档案查询
  • 绩效考核
  • 便民服务
  • 办事指南
  • 电子邮件