ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG) be a transitive permutation group of degree nn, and let ΓG\Gamma_G denote its derangement graph. For a positive integer cc, say that ΓG\Gamma_G contains no clique of size cc when it has no complete subgraph on cc vertices. Clique-bounded degree conjecture. There exists a function FF such that, if GG is a transitive permutation group of degree nn whose derangement graph contains no clique of size cc, then

n≤F(c).n\leq F(c).

The conjecture formalizes the observation that excluding large cliques in derangement graphs should strongly restrict the degree of a transitive action; the supplied text gives no resolution status.

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.