10 papers · 1 filter
The Grünbaum--Rigby configuration as a special Kárteszi configuration
Gábor Gévay, György Kiss, Tomaž Pisanski
In 1990, Branko Grünbaum and John Rigby presented a 4-configuration, known today as the \emph{Grünbaum--Rigby configuration}; it is denoted by . Independently an…
The Möbius-Kantor graph is a faithful unit-distance graph
Nino Bašić, Gábor Gévay, Tomaž Pisanski
In this paper, it has been shown that the generalized Petersen graph , also known as the Möbius-Kantor graph, admits a faithful unit-distance representation in t…
Polycyclic Geometric Realizations of the Gray Configuration
Leah Wrenn Berman, Gábor Gévay, Tomaž Pisanski
The Gray configuration is a (27_3) configuration which typically is realized as the points and lines of the 3 x 3 x 3 integer lattice. It occurs as a member of an infinite family o…
Explicit Constructions for Poncelet Polygons
Leah Wrenn Berman, Gábor Gévay, Jürgen Richter-Gebert +1
We study the geometric structure of Poncelet -gons from a projective point of view. In particular we present explicit constructions of Poncelet -gons for certain and deri…
When Grünbaum meets Poncelet -- Infinite Classes of Movable Configurations
Leah Wrenn Berman, Gábor Gévay, Jürgen Richter-Gebert +1
We study relations between incidence configurations and the classical Poncelet Porism. Poncelet's result studies two conics and a sequence of points and lines that inscribe…
The Gray graph is a unit-distance graph
Leah Wrenn Berman, Gábor Gévay, Tomaz Pisanski
In this note we give a construction proving that the Gray graph, which is the smallest cubic semi-symmetric graph, is a unit-distance graph.