\magnification=1200
\hsize=4in
\overfullrule=0pt
\input amssym
%\def\frac#1 #2 {{#1\over #2}}
\def\emph#1{{\it #1}}
\def\em{\it}
\nopagenumbers
\noindent
%
%
{\bf Ralph H. Buchholz and Warwick de Launey}
%
%
\medskip
\noindent
%
%
{\bf An Edge-Minimization Problem for Regular Polygons}
%
%
\vskip 5mm
\noindent
%
%
%
%
In this paper we will examine the following problem:
What is the minimum number of unit edges required to construct
$k$ identical size regular polygons in the plane if sharing of edges is 
allowed?

\bye