The super-strong conjecture on F-irregular graphs
Statement
Let be an integer. A graph is -hyper-irregular if it is -irregular for every graph , not necessarily connected, with order and size .
Super-strong conjecture on -irregular graphs. For each integer , there exist infinitely many -hyper-irregular graphs.
This is presented as a conjectural strengthening of the preceding -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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.