← All problems

Erdős's girth conjecture

10 years old · traced to

Let l,nl,n be positive integers. A graph with girth 2l+12l+1 and nn vertices is said to have many edges if its number of edges is bounded below by a positive constant times n1+1ln^{1+\frac{1}{l}}. Erdős's conjecture. For any positive integers l,nl,n, there exists a graph with girth 2l+12l+1, nn vertices and Ω(n1+1l)\Omega(n^{1+\frac{1}{l}}) edges. This conjecture concerns the extremal number of edges in graphs of prescribed odd girth and is related to the sharpness of upper bounds for graph radius in terms of minimum degree and girth.

References

3 papers in this index state this conjecture (2016–2020). The statement above is taken from the most recent of them; the others are arXiv:1710.03164, arXiv:1603.03526.

Source: Vojtěch Dvořák, Peter van Hintum, Amy Shaw and Marius Tiba, “Radius, Girth and Minimum Degree”, arXiv:2009.00741 (2020).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.