Skip to main content

2 Result(s)

within Konrad Swanepoel Remove this filter Computational Mathematics and Numerical Analysis Remove this filter

and

  1. Article

    Open Access

    A Tight Bound for the Number of Edges of Matchstick Graphs

    A matchstick graph is a plane graph with edges drawn as unit-distance line segments. Harborth introduced these graphs in 1981 and conjectured that the maximum number of edges for a matchstick graph on n vertices ...

    Jérémy Lavollée, Konrad Swanepoel in Discrete & Computational Geometry (2023)

    Download PDF (407 KB) View Article

  2. Article

    Open Access

    On Sets Defining Few Ordinary Circles

    An ordinary circle of a set P of n points in the plane is defined as a circle that contains exactly three points of P. We show that if P is not contained in a line or a circle, then P spans at least ...

    Aaron Lin, Mehdi Makhul, Hossein Nassajian Mojarrad… in Discrete & Computational Geometry (2018)

    Download PDF (941 KB) View Article