Unique minimal convergent subgraph conjecture
Statement
Let denote the class of graphs whose -line graph sequences converge, and let denote the class of minimally -convergent graphs. For graphs and , write when is a subgraph of .
Unique minimal subgraph conjecture. If and is not the disconnected union of two graphs in , then there exists a unique graph such that .
The conjecture is proposed as a further direction in the study of minimally -convergent graphs; the preceding theorem gives a related preservation result for unicyclic components under an additional girth hypothesis.
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.