The radial tree-width conjecture for graphs excluding quasi-geodesic subdivisions of the triangle
The radial tree-width conjecture for graphs excluding quasi-geodesic subdivisions of the triangle
Let be a connected graph. For , a -quasi-geodesic -subdivision of means a subdivision of the triangle whose subdivided paths are -quasi-geodesic and have length at least . The radial tree-width of is the tree-width notion defined for radial decompositions.
Radial tree-width conjecture. There is a function such that, if a connected graph does not contain a -quasi-geodesic -subdivision of for some , then
The preceding discussion explains that the subdivided-star argument does not directly produce a quasi-geodesic structural subgraph and presents this assertion as an unresolved question for trees. No resolution is given in the supplied text.
Sources & referencesView supporting material
Primary source
Sandra Albrechtsen, Reinhard Diestel, Ann-Kathrin Elm, Eva Fluck, Raphael W. Jacobs, Paul Knappe and Paul Wollan, “A structural duality for path-decompositions into parts of small radius”, arXiv:2307.08497 (2026).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.