Divergence from two non-isomorphic minimal convergent subgraphs
Statement
Let be a connected graph. The notation denotes the class of graphs whose -line graph sequences converge, and are subgraphs of .
Non-isomorphic subgraph conjecture. If and , then has a sequence that diverges by order.
The preceding theorem establishes divergence when the two distinct subgraphs belong to the more restricted family ; this conjecture proposes the corresponding statement for arbitrary non-isomorphic subgraphs in .
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.