Polylogarithmic independence number conjecture for Paley graphs
Statement
For a prime , let be the Paley graph, let be its complement, and write for its independence number. Here denotes a fixed polylogarithmic function of . Polylogarithmic independence-number conjecture.
Determining the independence number is a central problem connected with bounds for quadratic non-residues and Ramsey theory. The statement is described as widely believed, but remains open in the source.
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.