Mullin's conjecture on maximum cliques in Peisert graphs
Statement
Let be a prime power, and let denote the Peisert graph of order . A maximum clique is a clique of largest possible size. Mullin's conjecture. The only maximum clique in containing and is the subfield . The conjecture is an analogue of the corresponding characterization for Paley graphs. It is known when is prime and for sufficiently large by the results in the paper, but remains open in general.
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.