ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a strongly connected graph, and let B(G)B(G) denote the unique ≤R\leq_R-maximal right-resolving bunchy factor of GG. Write H≤SGH\leq_S G when there is a synchronizing right resolver from GG to HH.

Bunchy factor conjecture. For every strongly connected graph GG,

B(G)≤SG.B(G)\leq_S G.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.