For a simplicial 4-polytope P with n vertices in which every three vertices contain an edge, must its graph contain a clique of size at least n/10?
Statement
For a simplicial 4-polytope P with n vertices in which every three vertices contain an edge, must its graph contain a clique of size at least n/10? Given two continuous probability measures on S^2 and 0<\alpha<1/2, must some spherical cap have measure \alpha for both? Must every simple red-blue pseudoline arrangement contain a bounded triangular face incident to both colors? For a hypergraph H, does m_2^=3 imply that m_3^ is finite? Finally, what is the minimum number of partial triangulations of n points in general position in the plane, and is it C_{n-2}=\frac{1}{n-1}\binom{2n-4}{n-2}?
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.