ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A prime graph is a graph with no nontrivial module, and an infinite prime graph is a prime graph with infinitely many vertices. Let GμG_\mu denote the graph associated with a 00-11 sequence μ\mu on an interval of Z\mathbb{Z}, and let the finitely many graphs displayed in Figures 1 and 2 of the source be the listed finite exceptional graphs. The embedding conjecture. Every infinite prime graph contains, as an induced subgraph, one of those displayed graphs or a graph GμG_\mu for some 00-11 sequence μ\mu on an interval of Z\mathbb{Z}. The conjecture proposes a complete list of unavoidable induced subgraphs for infinite prime graphs; the source gives no resolution of it.

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.