A theorem on arrangements of lines in the plane

DOI10.1007/BF02788872zbMath0204.55205OpenAlexW2093180282WikidataQ56442901 ScholiaQ56442901MaRDI QIDQ2542037

R. J. Canham

Publication date: 1969

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02788872

Related Items

The complexity of cells in three-dimensional arrangements, Convex polygons made from few lines and convex decompositions of polyhedra, Polytopes, graphs, and complexes, Erased arrangements of linear and convex decompositions of polyhedra, Geometria combinatoria e geometrie finite, The maximal sizes of faces and vertices in an arrangement, Combinatorial complexity bounds for arrangements of curves and spheres, Partitioning arrangements of lines. II: Applications, The number of edges of many faces in a line segment arrangement, A problem of Zarankiewicz, The complexity and construction of many faces in arrangements of lines and of segments, The complexity of many cells in arrangements of planes and related problems, The number of isomorphism classes of spreads, Maximum face size in an arrangement of curves, On the maximal number of edges of many faces in an arrangement

Cites Work

• The Polygonal Regions into which a Plane is Divided by n Straight Lines
• Unnamed Item