Some combinatorial problems in the plane

DOI10.1016/0097-3165(78)90085-7zbMath0422.05023OpenAlexW2009038699WikidataQ56506081 ScholiaQ56506081MaRDI QIDQ1133547

Paul Erdős, George B. Purdy

Publication date: 1978

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(78)90085-7

zbMATH Keywords

linesProblemsfinite set of points in the plane

Mathematics Subject Classification ID

Problem books (00A07) Combinatorial aspects of finite geometries (05B25) Euclidean geometries (general) and generalizations (51M05)

Related Items (16)

A note on the minimum number of red lines needed to pierce the intersections of blue lines ⋮ On the number of directions determined by a three-dimensional points set ⋮ Two combinatorial problems in the plane ⋮ Lines, circles, planes and spheres ⋮ A solution to a problem of Grünbaum and Motzkin and of Erdős and Purdy about bichromatic configurations of points in the plane ⋮ Geometria combinatoria e geometrie finite ⋮ Crossing by lines all edges of a line arrangement ⋮ Progress on Dirac's conjecture ⋮ A one-page solution of a problem of Erdős and Purdy ⋮ On sets of \(n\) points in general position that determine lines that can be pierced by \(n\) points ⋮ Unnamed Item ⋮ Hirzebruch-type inequalities viewed as tools in combinatorics ⋮ Crossing edges and faces of line arrangements in the plane ⋮ Classification theorem for strong triangle blocking arrangements ⋮ Three-point configurations determined by subsets of \({\mathbb{F}_q}^2\) via the Elekes-Sharir paradigm ⋮ A \(t_k\) inequality for arrangements of pseudolines

Cites Work

• On some problems of elementary and combinatorial geometry
• The orchard problem
• On the Number of Ordinary Lines Determined by n Points
• On the Sets of Directions Determined by n Points
• On a Problem of Groübaum
• The Lines and Planes Connecting the Points of a Finite Set
• Unnamed Item

This page was built for publication: Some combinatorial problems in the plane