ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph in G(C^6)\mathcal{G}(\widehat{C}_{6}), and let xy∈E(G)xy \in E(G) be an edge. The edge xyxy is called relating when it has the relating-edge property used in the paper.

Relating-edge recognition conjecture. The following problem is polynomially solvable: given a graph G∈G(C^6)G \in \mathcal{G}(\widehat{C}_{6}) and an edge xy∈E(G)xy \in E(G), determine whether xyxy is relating.

The conjecture is proposed as a common generalization of the paper's polynomial results for related graph classes. Its resolution is not given in the supplied text.

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.