The duality between geometric thickness and geometric antithickness
The duality between geometric thickness and geometric antithickness
For a graph, geometric thickness is the minimum number of plane geometric layers in a straight-line drawing, and geometric antithickness is the minimum number of geometric thrackles whose edge sets partition the graph. Geometric duality conjecture. Geometric thickness and geometric antithickness are tied. The paper presents this as one of the proposed positive dualities between thickness-type parameters; its resolution is not given here.
Sources & referencesView supporting material
Primary source
Vida Dujmović and David R. Wood, “Thickness and Antithickness of Graphs”, arXiv:1708.04773 (2018).
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.