The bunchy factor conjecture in terms of the maximal bunchy factor
Statement
Let be a strongly connected graph, and let denote the unique -maximal right-resolving bunchy factor of . Write when there is a synchronizing right resolver from to .
Bunchy factor conjecture. For every strongly connected graph ,
This is presented as an equivalent formulation of the assertion that every strongly connected graph has a bunchy synchronizing factor. The source reports supporting results for bi-resolving graphs and computational evidence, but the general conjecture remains unresolved in the supplied text.
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.