Suppose H is a linear 3-uniform hypergraph, i
Statement
Kalai : Suppose H is a linear 3-uniform hypergraph, i.e., a subset of the set of all triples of n points with the property that no two edges intersect in more than one point. Further suppose that H is embedded in R^(3) faithfully, i.e., the vertices are placed in such a way that, for any two edges e_(1) and e_(2) of H, the planar triangles spanned by their respective vertices intersect if and only if e_(1) and e_(2) intersect in H, and, if they do intersect, they do so in precisely their common vertex. Show that the number of edges in H is o(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.