The following pages link to (Q3286826):
Displaying 50 items.
- Almost empty monochromatic triangles in planar point sets (Q299089) (← links)
- An improved upper bound for the Erdős-Szekeres conjecture (Q306509) (← links)
- Erdős-Szekeres without induction (Q309659) (← links)
- Separating families of convex sets (Q364852) (← links)
- On the order dimension of convex geometries (Q382888) (← links)
- Erdős-Szekeres theorem for point sets with forbidden subconfigurations (Q452006) (← links)
- A Ramsey-type result for geometric \(\ell\)-hypergraphs (Q740277) (← links)
- Erdős-Szekeres theorem for lines (Q745670) (← links)
- On \(k\)-gons and \(k\)-holes in point sets (Q899713) (← links)
- On the minimum number of mutually disjoint holes in planar point sets (Q904107) (← links)
- More on an Erdős-Szekeres-type problem for interior points (Q1042448) (← links)
- Topologically sweeping an arrangement (Q1122981) (← links)
- Nine convex sets determine a pentagon with convex sets as vertices (Q1123407) (← links)
- On the combinatorial classification of nondegenerate configurations in the plane (Q1146677) (← links)
- The complexity of point configurations (Q1175788) (← links)
- Convex independent sets and 7-holes in restricted planar point sets (Q1184157) (← links)
- On some problems of elementary and combinatorial geometry (Q1216631) (← links)
- Existence of submatrices with all possible columns (Q1244221) (← links)
- Highly saturated packings and reduced coverings (Q1383738) (← links)
- Chromatic variants of the Erdős--Szekeres theorem on points in convex position. (Q1410590) (← links)
- Point configurations in \(d\)-space without large subsets in convex position (Q1423586) (← links)
- Point sets with small integer coordinates and no large convex polygons (Q1704901) (← links)
- Two upper bounds for the Erdős-Szekeres number with conditions (Q1943650) (← links)
- A note on the value in the disjoint convex partition problem (Q1991778) (← links)
- On the existence of a point subset with 3 or 6 interior points (Q2014748) (← links)
- Faster counting empty convex polygons in a planar point set (Q2059898) (← links)
- On weighted sums of numbers of convex polygons in point sets (Q2167313) (← links)
- Two extensions of the Erdős-Szekeres problem (Q2216751) (← links)
- On \(k\)-convex point sets (Q2248736) (← links)
- Covering paths for planar point sets (Q2250054) (← links)
- On almost empty monochromatic triangles and convex quadrilaterals in colored point sets (Q2287740) (← links)
- Twenty years of progress of \(\mathrm{JCDCG}^3\) (Q2308489) (← links)
- A note on the upper bound for disjoint convex partitions (Q2342363) (← links)
- Erdős--Szekeres theorem with forbidden order types (Q2368653) (← links)
- On some monotone path problems in line arrangements (Q2387201) (← links)
- Almost empty hexagons (Q2453368) (← links)
- Empty convex hexagons in planar point sets (Q2482196) (← links)
- Coloring copoints of a planar point set (Q2499594) (← links)
- The maximum size of a convex polygon in a restricted set of points in the plane (Q2640144) (← links)
- Empty squares in arbitrary orientation among points (Q2700381) (← links)
- Regular systems of paths and families of convex sets in convex position (Q2790591) (← links)
- The Erdős-Szekeres Problem (Q2826813) (← links)
- On Erdős-Szekeres-type problems (Q2851501) (← links)
- On the Erdős–Szekeres problem in combinatorial geometry (Q3503469) (← links)
- Convex polygons in Cartesian products (Q5088949) (← links)
- Convex drawings of the complete graph: topology meets geometry (Q5089707) (← links)
- Specified holes with pairwise disjoint interiors in planar point sets (Q5154553) (← links)
- On the Erdős-Szekeres convex polygon problem (Q5280069) (← links)
- THE ERDŐS–SZEKERES PROBLEM AND AN INDUCED RAMSEY QUESTION (Q5376526) (← links)
- A SAT attack on the Erdős-Szekeres conjecture (Q5890914) (← links)
