Existence conjecture for non-trivial F-irregular graphs
Statement
Let be a connected graph of order at least . An -irregular graph is a graph in which no two distinct vertices have isomorphic -neighbourhoods.
Existence conjecture. For every connected graph of order or more, there exists a non-trivial -irregular graph.
The conjecture concerns the existence of irregular graphs relative to an arbitrary connected graph . It is known for stars and complete graphs of order at least , 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.