Convex Hulls of Point-Sets and Non-Uniform Hypergraphs

For fixed integers k >= 3 and hypergraphs G on N vertices, which contain edges of cardinalities at most k, and are uncrowded, i.e., do not contain cycles of lengths 2, 3, or 4, and with average degree for the i-element edges bounded by O(Ti for some number