Twin-pair conjecture for vertex-invariant algebraic co-rank
Statement
Let be a simple graph, let , and let denote the graph obtained by deleting . Twin-pair conjecture. If
then has at least one pair of twin vertices. This is proposed as a stronger variant of the twin-free lower-bound conjecture and remains open.
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.