Pages that link to "Item:Q1184155"
From MaRDI portal
The following pages link to An upper bound on the number of planar \(K\)-sets (Q1184155):
Displaying 26 items.
- A pseudo-algorithmic separation of lines from pseudo-lines (Q674001) (← links)
- On `\(k\)-sets' in the plane (Q1077725) (← links)
- More on k-sets of finite sets in the plane (Q1079816) (← links)
- Bounding the number of \(k\)-faces in arrangements of hyperplanes (Q1175787) (← links)
- Median hyperplanes in normed spaces -- a survey (Q1281394) (← links)
- A bound on local minima of arrangements that implies the upper bound theorem (Q1312194) (← links)
- On the expected number of \(k\)-sets (Q1327450) (← links)
- Algorithms for ham-sandwich cuts (Q1329191) (← links)
- \(k\)-violation linear programming (Q1336744) (← links)
- Cutting dense point sets in half (Q1355189) (← links)
- Improved bounds for planar \(k\)-sets and related problems (Q1387847) (← links)
- Continuous location of dimensional structures. (Q1410321) (← links)
- Lines and many points on both sides (Q1434251) (← links)
- Counting \(k\)-projections of a point set (Q1813981) (← links)
- On the number of line separations of a finite set in the plane (Q1821352) (← links)
- Dynamic half-space range reporting and its applications (Q1891228) (← links)
- Exact hyperplane covers for subsets of the hypercube (Q2037567) (← links)
- Algebraic \(k\)-sets and generally neighborly embeddings (Q2117359) (← links)
- Dense point sets with many halving lines (Q2207605) (← links)
- Forbidden k‐Sets in the Plane (Q3503223) (← links)
- New results on lower bounds for the number of (⩽ k)-facets (Q3503472) (← links)
- Point sets with many \(k\)-sets (Q5946377) (← links)
- An improved bound for \(k\)-sets in three dimensions (Q5946378) (← links)
- Improved bounds for the expected number of \(k\)-sets (Q6050223) (← links)
- Extremal problems for geometric hypergraphs (Q6487430) (← links)
- Repeatable patterns and the maximum multiplicity of a generator in a reduced word (Q6615533) (← links)