Determine boxicity for power graphs of arbitrary groups

Determine the boxicity of the power graph Pow(G) for every finite group G, without restricting G to be cyclic.

Background

The paper establishes a relationship between the power graph of a finite cyclic group and the divisor graph D(n), enabling the study of boxicity for cyclic power graphs through divisor graphs. It does not resolve the corresponding question for arbitrary finite groups.

The open problem asks for a determination of boxicity beyond cyclic groups, where the subgroup and generator structure can be substantially more complicated and the reduction to divisibility among the divisors of n is no longer available.