MathDB

Erdős Problem #799 — List chromatic number of almost every graph

About 46 years old · traced to

Is the list chromatic number χL(G)=o(n)\chi_L(G)=o(n) for almost every graph GG on nn vertices?

References

Primary source

N. Alon, M. Krivelevich, and B. Sudakov, List coloring of random and pseudo-random graphs, Combinatorica 19 (1999), 453–472.

Additional references

N. Alon, M. Krivelevich, and B. Sudakov, List coloring of random and pseudo-random graphs, Combinatorica 19 (1999), 453–472.

chromatic-numbergraph-theory
InErdős Problems
Posted

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.