ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let n⩾3n\geqslant 3 be an integer. A graph GG is nn-hyper-irregular if it is FF-irregular for every graph FF, not necessarily connected, with order ∣F∣⩽n|F|\leqslant n and size ∣E(F)∣⩾2|E(F)|\geqslant 2.

Super-strong conjecture on FF-irregular graphs. For each integer n⩾3n\geqslant 3, there exist infinitely many nn-hyper-irregular graphs.

This is presented as a conjectural strengthening of the preceding FF-irregularity conjecture. The supplied text gives no resolution or partial result for this super-strong version.

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.