Jie Ma (马杰) gave an online talk on the maximum number of edges in a 2-connected graph with no two cycles of the same length at the Virtual Discrete Math Colloquium

On February 10, 2021, Jie Ma (马杰) from the University of Science and Technology of China gave an online talk at the Virtual Discrete Math Colloquium about the resolution of a conjecture of Boros, Caro, Füredi, and Yuster on the maximum number of edges in a 2-connected graph without two cycles of the same length. The title of his talk was “Non-repeated cycle lengths and Sidon sequences“.