ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG 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 v∈Gv\in G, attaching a single tree of size 11 to vv results in a graph with the complete identity property, then

Bipartiteness conjecture. GG is bipartite.

The conjecture is motivated by a computer search showing that every connected graph with at most 1010 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.