Given a finite planar point set P, let tr(P) and st(P) be the numbers of triangulations and crossing-free spanning trees, respectively.
Statement
Given a finite planar point set P, let tr(P) and st(P) be the numbers of triangulations and crossing-free spanning trees, respectively. Is there a real constant c>1 such that, for every sufficiently large P, st(P)≥c^{|P|}·tr(P)?
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.