报告主题：
Non-repeated cycle lengths and Sidon sequences(不重复圈长与Sidon序列)
时间：2020年11月19日15:00-17:00
地点：腾讯会议 913 294 202
报告人：马杰（邀请人：张赞波）
报告摘要： We prove a conjecture of Boros, Caro, Furedi and Yuster on the maximum number of edges in a 2-connected graph without repeated cycle lengths, which is a restricted version of a longstanding problem of Erdos. Our proof together with the matched lower bound construction of Boros, Caro, Furedi and Yuster show that this problem can be conceptually reduced to the seminal problem of finding the maximum Sidon sequences in number theory. Joint work with Tianchi Yang.
报告人简介：马杰，现任中国科学技术大学数学科学学院教授，博士生导师。研究领域为极值组合，图论，概率组合，及其在计算机科学和优化问题方面的应用。2017年获国家优秀青年科学基金项目资助。2018年开始担任SIAM离散数学杂志编委。
