Bonato–Tardif's tree alternative conjecture
Statement
Let and be non-isomorphic graphs. We call a twin of if there are embeddings and , that is, injective maps and preserving adjacency. Tree alternative conjecture. A tree has either none or infinitely many isomorphism classes of twins. This conjecture concerns the possible number of mutually embeddable but non-isomorphic graphs associated with a tree; its status is not established in the supplied source.
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.