Unicyclic-components conjecture for minimally n-convergent graphs
Statement
Let denote the class of minimally -convergent graphs, and let the components of a graph be its connected components. A component is unicyclic when it contains exactly one cycle.
Unicyclic-components conjecture. If , then has unicyclic components.
The conjecture concerns the structure of minimally -convergent graphs and is presented as a proposed structural description that would facilitate further results about these graphs.
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.