The following pages link to Point sets with many \(k\)-sets (Q5946377):
Displaying 13 items.
- Minimizing the error of linear separators on linearly inseparable data (Q427883) (← links)
- On \(\leq k\)-edges, crossings, and halving lines of geometric drawings of \(K _{n }\) (Q443913) (← links)
- On levels in arrangements of surfaces in three dimensions (Q443917) (← links)
- Long non-crossing configurations in the plane (Q603879) (← links)
- The projection median of a set of points in \({\mathbb{R}}^{d}\) (Q664356) (← links)
- On the maximum size of an anti-chain of linearly separable sets and convex pseudo-discs (Q731372) (← links)
- Kinetic and dynamic data structures for convex hulls and upper envelopes (Q857064) (← links)
- Efficient algorithms for maximum regression depth (Q938312) (← links)
- A combinatorial version of Sylvester's four-point problem (Q990768) (← links)
- On the conjectured upper bounds for entries of mutation count matrices (Q1041608) (← links)
- An improvement of the lower bound on the maximum number of halving lines in planar sets with 32 points (Q1792119) (← links)
- On the complexity of the \(k\)-level in arrangements of pseudoplanes (Q2022137) (← links)
- Separation by convex pseudo-circles (Q2022622) (← links)
