The embedding conjecture for infinite prime graphs
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 denote the graph associated with a - sequence on an interval of , 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 for some - sequence on an interval of . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.