ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let FF be a connected graph of order at least 33. An FF-irregular graph is a graph in which no two distinct vertices have isomorphic FF-neighbourhoods.

Existence conjecture. For every connected graph FF of order 33 or more, there exists a non-trivial FF-irregular graph.

The conjecture concerns the existence of irregular graphs relative to an arbitrary connected graph FF. It is known for stars and complete graphs of order at least 33, but the general case is not resolved 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.