Pages that link to "Item:Q1389166"
From MaRDI portal
The following pages link to Extremal problems for geometric hypergraphs (Q1389166):
Displaying 20 items.
- Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry (Q708383) (← links)
- A Ramsey-type result for geometric \(\ell\)-hypergraphs (Q740277) (← links)
- An extremal problem in geodetic graphs (Q792335) (← links)
- Convex subdivisions with low stabbing numbers (Q1046805) (← links)
- On a bound in extremal combinatorics (Q1643771) (← links)
- Entropy of convex functions on \(\mathbb R^d\) (Q1691434) (← links)
- Extremal problems for pairs of triangles (Q2131860) (← links)
- On the number of hyperedges in the hypergraph of lines and pseudo-discs (Q2161213) (← links)
- \(k\)-sets and rectilinear crossings in complete uniform hypergraphs (Q2173451) (← links)
- Rectilinear crossings in complete balanced \(d\)-partite \(d\)-uniform hypergraphs (Q2175816) (← links)
- Bracketing numbers of convex and \(m\)-monotone functions on polytopes (Q2182917) (← links)
- On the rectilinear crossing number of complete uniform hypergraphs (Q2362105) (← links)
- Coloring \(d\)-embeddable \(k\)-uniform hypergraphs (Q2514227) (← links)
- On Codimension One Embedding of Simplicial Complexes (Q4604375) (← links)
- PARTITIONING COLORED POINT SETS INTO MONOCHROMATIC PARTS (Q4818568) (← links)
- (Q4871765) (← links)
- Maximum rectilinear crossing number of uniform hypergraphs (Q6083186) (← links)
- Transversals and colorings of simplicial spheres (Q6151037) (← links)
- Extremal problems for geometric hypergraphs (Q6487430) (← links)
- The complexity of recognizing geometric hypergraphs (Q6560147) (← links)
