The following pages link to Pavel Valtr (Q322286):
Displaying 50 items.
- Bend-optimal orthogonal graph drawing in the general position model (Q390165) (← links)
- Graph sharing games: complexity and connectivity (Q391088) (← links)
- Splittings and Ramsey properties of permutation classes (Q477770) (← links)
- On the Beer index of convexity and its variants (Q512263) (← links)
- On three measures of non-convexity (Q522338) (← links)
- Large convexly independent subsets of Minkowski sums (Q612927) (← links)
- Coding and counting arrangements of pseudolines (Q644821) (← links)
- Augmenting the edge connectivity of planar straight line graphs to three (Q652523) (← links)
- On the connectivity of visibility graphs (Q715001) (← links)
- On the intersections of non-homotopic loops (Q831716) (← links)
- On the connectivity and the diameter of betweenness-uniform graphs (Q831737) (← links)
- On triconnected and cubic plane graphs on given point sets (Q833718) (← links)
- On the positive fraction Erdős-Szekeres theorem for convex sets (Q852711) (← links)
- On \(k\)-gons and \(k\)-holes in point sets (Q899713) (← links)
- Empty convex polygons in almost convex sets (Q950297) (← links)
- On edges crossing few other edges in simple topological complete graphs (Q1011770) (← links)
- Convex independent sets and 7-holes in restricted planar point sets (Q1184157) (← links)
- Sets in \(\mathbb{R}^ d\) with no large empty convex subsets (Q1201240) (← links)
- Generalized Davenport-Schinzel sequences with linear upper bound (Q1201254) (← links)
- The largest \(k\)-ball in a \(d\)-dimensional box (Q1272308) (← links)
- On the density of subgraphs in a graph with bounded independence number (Q1272486) (← links)
- Ramsey-type results for geometric graphs. II (Q1272962) (← links)
- On an extremal problem for colored trees (Q1279875) (← links)
- Guarding galleries where no point sees a small area. (Q1279960) (← links)
- On galleries with no bad points (Q1283765) (← links)
- Unit squares intersecting all secants of a square (Q1317880) (← links)
- Generalized Davenport-Schinzel sequences (Q1343170) (← links)
- (Q1355188) (redirect page) (← links)
- Cutting dense point sets in half (Q1355189) (← links)
- The probability that \(n\) random points in a triangle are in convex position (Q1375700) (← links)
- A Ramsey property of order types (Q1380338) (← links)
- A positive fraction Erdős-Szekeres theorem (Q1387842) (← links)
- Note on the Erdős-Szekeres theorem (Q1387857) (← links)
- On geometric graphs with no \(k\) pairwise parallel edges (Q1389246) (← links)
- Davenport-Schinzel trees (Q1416158) (← links)
- Point configurations in \(d\)-space without large subsets in convex position (Q1423586) (← links)
- On ordered Ramsey numbers of bounded-degree graphs (Q1633749) (← links)
- On the maximum crossing number (Q1642684) (← links)
- Drawing graphs using a small number of obstacles (Q1702349) (← links)
- Covering lattice points by subspaces and counting point-hyperplane incidences (Q1716001) (← links)
- Almost-tiling the plane by ellipses (Q1807610) (← links)
- Geometric graphs with few disjoint edges (Q1809516) (← links)
- The partitioned version of the Erdős-Szekeres theorem (Q1864120) (← links)
- A sufficient condition for the existence of large empty convex polygons (Q1864123) (← links)
- Probability that \(n\) random points are in convex position (Q1892438) (← links)
- Ramsey-remainder (Q1922879) (← links)
- Lines, line-point incidences and crossing families in dense sets (Q1924496) (← links)
- On visibility and covering by convex sets (Q1961351) (← links)
- On crossing-families in planar point sets (Q2144455) (← links)
- Non-homotopic loops with a bounded number of pairwise intersections (Q2151444) (← links)
