ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let P\mathcal{P} be a set of nn points in the plane, and let there be mm topological trees such that every pair of trees intersects exactly once and every leaf of every tree belongs to P\mathcal{P}. Strengthened thrackle conjecture. We conjecture that

m≤n.m\le n.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.