Winding partitions conjecture for drawings of complete graphs

From papers

Let K3(q1)+1K_{3(q-1)+1} be the complete graph on 3(q1)+13(q-1)+1 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 q1q-1 pairwise disjoint triangles of edges and a vertex vv, or q2q-2 pairwise disjoint triangles of edges and an intersection point pp of two edges, such that the winding number about vv, respectively about pp, of every triangle is nonzero. The conjecture is connected to the d=2d=2 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

No solutions have been posted yet.