ProbXiv
Explorersign in
Problem archiveProblem record

Statement

It seems feasible that the answer to this question is affirmative for every finite group G. In the graph-theoretic formulation of these problems, which we will describe below, Gordon’s setting corresponds to the complete graph case (in particular, a directed variant of a well-known conjecture of Andersen [2]), whereas Theorem 1 corresponds to a sparse analogue. This problem was first posed by Graham [10] in 1971 and later reiterated in an open problems book of Erdős and Graham [8]. The intermediate regime remains open. The report passage is retained verbatim as the relevant context for this extracted problem.

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.