ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a finite graph. Write drn(G)drn(G) for its derangement representation number and p(G)p(G) for its order, and let

F={K2‾,K3‾,P3}.\mathcal{F}=\{\overline{K_2},\overline{K_3},P_3\}.

Derangement representation conjecture. For every finite graph GG except the graphs in F\mathcal{F},

drn(G)≤p(G).drn(G)\leq p(G).

The conjecture summarizes the examples reviewed in the paper, for which the derangement representation number is less than the order apart from the three listed exceptions. Its general validity for finite graphs remains open.

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.