Pavel Valtr Lines, Line-Point Incidences and Crossing Families in Dense Sets. [Citation Graph (0, 0)][DBLP] Combinatorica, 1996, v:16, n:2, pp:269-294 [Journal]
Pavel Valtr The Probability that n Random Points in a Triangle Are in Convex Position. [Citation Graph (0, 0)][DBLP] Combinatorica, 1996, v:16, n:4, pp:567-573 [Journal]
Gyula Károlyi, Pavel Valtr Point Configurations in d-Space without Large Subsets in Convex Position. [Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 2003, v:30, n:2, pp:277-286 [Journal]
Pavel Valtr A Sufficient Condition for the Existence of Large Empty Convex Polygons. [Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 2002, v:28, n:4, pp:671-682 [Journal]
Pavel Valtr Convex Independent Sets and 7-holes in Restricted Planar Point Sets. [Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 1992, v:7, n:, pp:135-152 [Journal]
Pavel Valtr Unit Squares Intersecting All Secants of a Square. [Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 1994, v:11, n:, pp:235-239 [Journal]
Pavel Valtr Probability that n Random Points are in Convex Position. [Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 1995, v:13, n:, pp:637-643 [Journal]
Pavel Valtr On Geometric Graphs with No k Pairwise Parallel Edges. [Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 1998, v:19, n:3, pp:461-469 [Journal]
Pavel Valtr On Galleries with No Bad Points. [Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 1999, v:21, n:2, pp:193-200 [Journal]
Pavel Valtr On the Density of Subgraphs in a Graph with Bounded Independence Number. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1998, v:73, n:2, pp:146-158 [Journal]
Pavel Valtr Open Caps and Cups in Planar Point Sets. [Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 2007, v:37, n:4, pp:565-576 [Journal]
Pavel Valtr Sets in Rd with no large empty convex subsets. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1992, v:108, n:1-3, pp:115-124 [Journal]