Strong Conjecture about F-Irregular Graphs
Statement
For every connected simple finite graph with , there exist infinitely many simple finite graphs such that, for every pair of distinct vertices , the numbers of copies of in containing and containing are different; that is, whenever .
Record
- Source
- Added
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.