Bipartiteness conjecture for graphs with the complete identity property after attaching trees
Statement
Let be a connected graph. A graph has the complete identity property if every vertex can serve as the sink and the recurrent identity is the same configuration. If, for every vertex , attaching a single tree of size to results in a graph with the complete identity property, then
Bipartiteness conjecture. is bipartite.
The conjecture is motivated by a computer search showing that every connected graph with at most vertices having this property is bipartite, although not every bipartite graph has the property. Its general validity 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.