Tolue's prime-degree non-centralizer graph conjecture

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.

Sources & referencesView supporting material

Primary source

Tariq A. Alraqad and Hicham Saber, “On the Structure of Finite Groups Associated to Regular Non-Centralizer Graph”, arXiv:1812.09363 (2018).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.