ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG and HH be non-isomorphic graphs. We call HH a twin of GG if there are embeddings G→HG\to H and H→GH\to G, that is, injective maps V(G)→V(H)V(G)\to V(H) and V(H)→V(G)V(H)\to V(G) 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 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.