Classification theorem for strong triangle blocking arrangements

DOI10.2298/PIM2021001MzbMath1474.52023arXiv1809.08639MaRDI QIDQ4985669

Luka Milićević

Publication date: 24 April 2021

Published in: Publications de l'Institut Math?matique (Belgrade) (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1809.08639

zbMATH Keywords

blocking setsordinary linessegment arrangements

Mathematics Subject Classification ID

Blocking sets, ovals, (k)-arcs (51E21) Erd?s problems and related topics of discrete geometry (52C10) Planar arrangements of lines and pseudolines (aspects of discrete geometry) (52C30)

Related Items (2)

A note on the minimum number of red lines needed to pierce the intersections of blue lines ⋮ Unnamed Item

Cites Work

• On sets defining few ordinary lines
• A solution to a problem of Grünbaum and Motzkin and of Erdős and Purdy about bichromatic configurations of points in the plane
• On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry
• Extremal problems in discrete geometry
• A resolution of the Sylvester-Gallai problem of J.-P. Serre
• Some combinatorial problems in the plane
• There are not too many magic configurations

This page was built for publication: Classification theorem for strong triangle blocking arrangements