A strengthening of the thrackle conjecture for topological trees
Statement
Let be a set of points in the plane, and let there be topological trees such that every pair of trees intersects exactly once and every leaf of every tree belongs to . Strengthened thrackle conjecture. We conjecture that
This is posed as a strengthening of the thrackle conjecture, asserting a linear upper bound on the number of pairwise once-intersecting topological trees whose leaves lie in a prescribed set of points. The source does not indicate that this strengthening has been resolved.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.