The nucleus characterization conjecture for graph braid groups
Statement
For a graph and a braid index , let denote its graph braid group. An -nucleus is a minimal graph whose -braid group is not a right-angled Artin group, while the -braid group of every graph contained in it is a right-angled Artin group. Nucleus characterization conjecture. For every braid index , a graph contains no -nuclei if and only if is a right-angled Artin group. The paper proves this equivalence for and conjectures that it holds for all braid indices.
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.