Extremal problems for geometric hypergraphs
From MaRDI portal
Publication:1389166
DOI10.1007/PL00009365zbMATH Open0902.05054OpenAlexW2024662946MaRDI QIDQ1389166FDOQ1389166
Authors: 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
Recommendations
Cited In (22)
- Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry
- Title not available (Why is that?)
- The complexity of recognizing geometric hypergraphs
- On a bound in extremal combinatorics
- Transversals and colorings of simplicial spheres
- Bracketing numbers of convex and \(m\)-monotone functions on polytopes
- An extremal problem in geodetic graphs
- Extremal problems for pairs of triangles
- A Ramsey-type result for geometric \(\ell\)-hypergraphs
- Maximum rectilinear crossing number of uniform hypergraphs
- On the number of hyperedges in the hypergraph of lines and pseudo-discs
- Extremal problems for geometric hypergraphs
- Coloring \(d\)-embeddable \(k\)-uniform hypergraphs
- Applications of graph and hypergraph theory in geometry
- A note on geometric 3-hypergraphs
- \(k\)-sets and rectilinear crossings in complete uniform hypergraphs
- Rectilinear crossings in complete balanced \(d\)-partite \(d\)-uniform hypergraphs
- Convex subdivisions with low stabbing numbers
- On the rectilinear crossing number of complete uniform hypergraphs
- Entropy of convex functions on \(\mathbb R^d\)
- On codimension one embedding of simplicial complexes
- PARTITIONING COLORED POINT SETS INTO MONOCHROMATIC PARTS
This page was built for publication: Extremal problems for geometric hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1389166)
