When: Sunday, April 25, 10am
Where: Schreiber 309
Speaker: Jie Ma, USTC
Title:
Non-repeated cycle lengths vs Sidon sequences
In this talk, we will present a proof of 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. This 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.