The conjecture on existence of F-irregular graphs
Statement
Let and be graphs. The -degree of a vertex in is the number of subgraphs of isomorphic to that contain . A graph is -irregular if any two distinct vertices of have different -degrees.
Existence conjecture. For every connected graph on three or more vertices, there exists an -irregular graph.
The conjecture generalizes the known existence results for complete graphs and stars. It was later strengthened by the assertion that infinitely many such graphs exist for every connected graph of order at least ; the general conjecture is solved here only for the class of graphs of diameter .
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.