Extremal problems for geometric hypergraphs
From MaRDI portal
Bounds for the largest number of edges (\(i\)-simplices) in a geometric hypergraph with forbidden configurations such as intersecting edges, crossing edges, pairwise crossing edges, etc., are derived. Some of the bounds are tight.
Recommendations
Cited in
(24)- Convex subdivisions with low stabbing numbers
- On a bound in extremal combinatorics
- Entropy of convex functions on \(\mathbb R^d\)
- Extremal problems for pairs of triangles
- On the number of hyperedges in the hypergraph of lines and pseudo-discs
- \(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
- On the rectilinear crossing number of complete uniform hypergraphs
- Coloring \(d\)-embeddable \(k\)-uniform hypergraphs
- A note on geometric 3-hypergraphs
- On codimension one embedding of simplicial complexes
- PARTITIONING COLORED POINT SETS INTO MONOCHROMATIC PARTS
- scientific article; zbMATH DE number 863486 (Why is no real title available?)
- Applications of graph and hypergraph theory in geometry
- Maximum rectilinear crossing number of uniform hypergraphs
- Transversals and colorings of simplicial spheres
- Extremal problems for geometric hypergraphs
- The complexity of recognizing geometric hypergraphs
- The complexity of recognizing geometric hypergraphs
- Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry
- On colorings of hypergraphs embeddable in \(\mathbb{R}^d\)
- A Ramsey-type result for geometric -hypergraphs
- An extremal problem in geodetic graphs
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)
