Extremal problems for geometric hypergraphs

DOI10.1007/PL00009365zbMath0902.05054OpenAlexW2024662946MaRDI QIDQ1389166

D. Massart

Publication date: 11 June 1998

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00009365

zbMATH Keywords

boundsgeometric hypergraphcrossing

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65)

Related Items (12)

On the rectilinear crossing number of complete uniform hypergraphs ⋮ PARTITIONING COLORED POINT SETS INTO MONOCHROMATIC PARTS ⋮ \(k\)-sets and rectilinear crossings in complete uniform hypergraphs ⋮ Rectilinear crossings in complete balanced \(d\)-partite \(d\)-uniform hypergraphs ⋮ Bracketing numbers of convex and \(m\)-monotone functions on polytopes ⋮ Maximum rectilinear crossing number of uniform hypergraphs ⋮ Entropy of convex functions on \(\mathbb R^d\) ⋮ Transversals and colorings of simplicial spheres ⋮ On Codimension One Embedding of Simplicial Complexes ⋮ Coloring \(d\)-embeddable \(k\)-uniform hypergraphs ⋮ A Ramsey-type result for geometric \(\ell\)-hypergraphs ⋮ Convex subdivisions with low stabbing numbers

This page was built for publication: Extremal problems for geometric hypergraphs