MathDB

Erdős Problem #572 — Show that for k≥3k\geq 3 ex(n;C2k)≫n1+1k.\mathrm{ex}(n;C_{2k})\gg n^{1+\frac{1}{k}}.

About 62 years old · traced to

Show that for k≥3k\geq 3 ex(n;C2k)≫n1+1k.\mathrm{ex}(n;C_{2k})\gg n^{1+\frac{1}{k}}.

References

Primary source

ULAM AI, UnsolvedMath dataset, Erdős Problems set, revision b9437975f3c873f635a13c48f8b022f5ba80898a; CC BY 4.0.

Additional references

UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.

graph-theoryturan-number
InErdős Problems
Posted · edited

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.