ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a finite group, let Z(G)Z(G) be its center, and let ΥG\Upsilon_G be the simple graph whose vertices are the elements of GG, with distinct vertices xx and yy adjacent when CG(x)≠CG(y)C_G(x)\neq C_G(y), where CG(x)C_G(x) is the centralizer of xx in GG. A graph is pp-regular if every vertex has degree pp, where pp is prime. Tolue's conjecture. The graph ΥG\Upsilon_G is not pp-regular for any prime integer pp. The conjecture concerns restrictions on the possible regular degrees of non-centralizer graphs; the source attributes it to Tolue and records the cases of degrees 4,5,6,7,8,11,134,5,6,7,8,11,13, with degree 66 occurring precisely for D8D_8 and Q8Q_8.

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.