English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In 1975, P. Erdős proposed the problem of determining the maximum number $f(n)$ of edges in a simple graph of $n$ vertices in which any two cycles are of different lengths. In this paper, it is proved that $$f(n)\geq n+32t-1$$ for $t=27720r+169 \,\ (r\geq 1)$ and $n\geq {{6911}\over {16}}t^{2}+{{514441}\over {8}}t-{{3309665}\over {16}}$. Consequently, $\liminf _{n \to \infty} {f(n)-n \over \sqrt n} \geq \sqrt {2 + {2562 \over 6911}}.$

A Lower Bound for the Number of Edges in a Graph Containing No Two Cycles of the Same Length