The ultra-fat half-grid conjecture for quasi-transitive locally finite graphs
Statement
Let be a connected, quasi-transitive, locally finite graph. An end of is thick if it contains infinitely many pairwise disjoint rays, and an ultra-fat model of the half-grid is a model of the half-grid in satisfying the ultra-fatness condition defined in the paper.
Ultra-fat half-grid conjecture. Every connected, quasi-transitive, locally finite graph with a thick end contains an ultra-fat model of the half-grid.
This assertion would suffice to extend the equivalence between the existence of a thick end, the presence of the half-grid as an ultra-fat, asymptotic, or diverging minor, and failure to be quasi-isometric to a tree from accessible graphs to all connected, quasi-transitive, locally finite graphs. Its status is not resolved 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.