MathDB

Erdős Problem #574 — Is it true that, for k≥2k\geq 2, ex(n;{C2k−1,C2k})=(1+o(1))(n/2)1+1k.\mathrm{ex}(n;\{C_{2k-1},C_{2k}\})=(1+o(1))(n/2)^{1+\frac{1}{k}}.

At least 14 years old · documented by

Is it true that, for k≥2k\geq 2, ex(n;{C2k−1,C2k})=(1+o(1))(n/2)1+1k.\mathrm{ex}(n;\{C_{2k-1},C_{2k}\})=(1+o(1))(n/2)^{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.