Convergence of the random-graph k-colorability threshold
Statement
For each fixed integer , let be the Achlioptas–Friedgut threshold sequence such that, for every , a random graph with average degree is a.a.s. -colorable, whereas a random graph with average degree is a.a.s. non--colorable. Does converge as ? If so, to what value?
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.