Abstract
In 1975, P. Erdös proposed the problem of determining the maximum number f(n) of edges in a graph with n vertices in which any two cycles are of different lengths. In this paper, it is proved that f(n)≥n+1073t+73for t=1260r+169(r≥1) and n≥21194t2+87978t+159574. Consequently, lim infn→∞f(n)−nn≥2+765419071, which is better than the previous bounds 2 (Shi, 1988), 2.4 (Lai, 2003). The conjecture limn→∞f(n)−nn=2.4 is not true.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
