Winding partitions conjecture for drawings of complete graphs
Winding partitions conjecture for drawings of complete graphs
Let be the complete graph on vertices, and consider any drawing of this graph in the plane. For a triangle of edges and a point not on it, its winding number about the point is the usual winding number of the closed triangular curve. Winding partitions conjecture. Every drawing has either pairwise disjoint triangles of edges and a vertex , or pairwise disjoint triangles of edges and an intersection point of two edges, such that the winding number about , respectively about , of every triangle is nonzero. The conjecture is connected to the case of the general Tverberg-partition problem through geometric graph theory. The paper presents it as an equivalent formulation of that case; no resolution is given here.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Stephan Hell, “On the number of Tverberg partitions in the prime power case”, arXiv:math/0404406 (2004).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.