1 citations · 2 across the 11 of their papers we have counts for
12 papers
On Chasles' Quadrilateral Theorem
Leah Wrenn Berman, Jürgen Richter-Gebert
Chasles' Quadrilateral Theorem is a classical statement about four tangents to a conic that simultaneously circumscribe a circle. In its various formulations, it relates the concur…
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.
On a new (21_4) polycyclic configuration
Leah Wrenn Berman, Gábor Gévay, Tomaz Pisanski
When searching for small 4-configurations of points and lines, polycyclic configurations, in which every symmetry class of points and lines contains the same number of elements, ha…
Semicubic cages and small graphs of even girth from voltage graphs
Flor Aguilar, Gabriela Araujo-Pardo, Leah Bermann
An \emph{ semicubic graph} is a graph in which all vertices have degrees either or and fixed girth . In this paper, we construct families of semicubic graphs of…
Symmetries of the Woolly Hat graphs
Leah Wrenn Berman, Hiroki Koike, Elias Mochan +3
A graph is edge-transitive if the natural action of its automorphism group on its edge set is transitive. An automorphism of a graph is semiregular if all of the orbits of the subg…
New bounds on the existence of and configurations: the Grünbaum Calculus revisited
Leah Wrenn Berman, Gábor Gévay, Tomaž Pisanski
The "Grünbaum Incidence Calculus" is the common name of a collection of operations introduced by Branko Grünbaum to produce new configurations from various input configur…
Eventually, geometric configurations exist for all
Leah Wrenn Berman, Gábor Gévay, Tomaž Pisanski
In a series of papers and in his 2009 book on configurations Branko Grünbaum described a sequence of operations to produce new configurations from various input configura…
Cyclic pseudo-{L}oupekine snarks
Leah Wrenn Berman, Déborah Oliveros, Gordon I. Williams
In 1976, Loupekine introduced (via Isaacs) a very general way of constructing new snarks from old snarks by cyclically connecting multipoles constructed from smaller snarks. In thi…
Graphs with obstacle number greater than one
Leah Wrenn Berman, Glenn G. Chappell, Jill R. Faudree +3
An \emph{obstacle representation} of a graph is a straight-line drawing of in the plane together with a collection of connected subsets of the plane, called \emph{obstacles…