MathDB

Erdős Problem #1104 — Let f(n)f(n) be the maximum possible chromatic number of a triangle-free graph on nn vertices.

About 59 years old · traced to

Let f(n)f(n) be the maximum possible chromatic number of a triangle-free graph on nn vertices. Estimate f(n)f(n).

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.

chromatic-numbergraph-theory
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.