Year: 2020
Type: preprint
Abstract: We prove a conjecture of Boros, Caro, Füredi 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 Erdős. Our proof together with the matched lower bound construction of Boros, Caro, Füredi and Yuster show that this problem can be conceptually reduced to the seminal problem of finding the maximum Sidon sequences in number theory.
Source: arXiv (Cornell University)
Authors: Ma, Jie, Yang, Tianchi
Institution: University of Science and Technology of China
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
Award: G2208725559
OpenAlex ID: W3044681409