Staircase characterization conjecture for extremal star-forest decompositions
Staircase characterization conjecture for extremal star-forest decompositions
Let be a positive integer, and let be a complete geometric graph on points. A -staircase is the point-set construction defined earlier in the source. Staircase characterization conjecture. If admits a decomposition into plane star-forests and the convex hull of has size , then can be described as a -staircase. The source reports that computations on point sets with and points found no counterexamples, but gives no proof or resolution. Thus the characterization remains open.
Sources & referencesView supporting material
Primary source
Todor Antić, Jelena Glišić and Milan Milivojčević, “Star-Forest Decompositions of Complete Graphs”, arXiv:2402.11044 (2024).
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.