For a hypergraph H, does m_2^*=3 imply that m_3^* is finite?
Statement
For a hypergraph H, does m_2^=3 imply that m_3^ is finite? What is the minimum number of partial triangulations of n points in general position in the plane, and is it the Catalan number C_{n-2}=\frac{1}{n-1}\binom{2n-4}{n-2}? The report also asks whether the graph of a simplicial 4-polytope with the stated three-vertex density contains a clique of size n/10, whether two measures on S^2 admit a common spherical cap of measure \alpha, and whether a red-blue pseudoline arrangement has a bichromatic bounded triangular face.
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.