Isomorphic-vertex conjecture for critical banned graphs
Statement
Let a graph be critical banned in dimension when it is banned in dimension but deleting any vertex lowers the required dimension. Two vertices are isomorphic when deleting either one produces a graph of smaller dimension and the two resulting graphs are isomorphic. The isomorphic-vertex conjecture. Every graph critical banned in dimension has at least two isomorphic vertices. The source gives no proof or resolution.
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.