ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let q≡3(mod4)q\equiv 3\pmod 4 be a prime power, and let Pq2∗P^*_{q^2} denote the Peisert graph of order q2q^2. A maximum clique is a clique of largest possible size. Mullin's conjecture. The only maximum clique in Pq2∗P^*_{q^2} containing 00 and 11 is the subfield Fq\mathbb{F}_q. The conjecture is an analogue of the corresponding characterization for Paley graphs. It is known when qq is prime and for sufficiently large qq 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.