MathDB

Erdős Problem #571 — Show that for any rational α∈[1,2)\alpha \in [1,2) there exists a bipartite graph GG such that ex(n;G)≍nα.\mathrm{ex}(n;G)\asymp n^{\alpha}.

About 48 years old · traced to

Show that for any rational α∈[1,2)\alpha \in [1,2) there exists a bipartite graph GG such that ex(n;G)≍nα.\mathrm{ex}(n;G)\asymp n^{\alpha}.

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.