\documentclass[12pt]{article}
\usepackage{amsmath,mathrsfs,bbm}
\usepackage{amssymb}
\textwidth=4.825in
\overfullrule=0pt
\thispagestyle{empty}

\begin{document}
\noindent
%
%
{\bf Sang-il Oum}
%
%

\medskip
\noindent
%
%
{\bf Perfect Matchings in Claw-free Cubic Graphs}
%
%

\vskip 5mm
\noindent
%
%
%
%
Lov\'asz and Plummer conjectured that there exists a fixed positive
constant $c$ such that every cubic $n$-vertex graph with no cutedge
has at least $2^{cn}$ perfect matchings.  Their conjecture has been
verified for bipartite graphs by Voorhoeve and planar graphs by
Chudnovsky and Seymour.  We prove that every claw-free cubic
$n$-vertex graph with no cutedge has more than $2^{n/12}$ perfect
matchings, thus verifying the conjecture for claw-free graphs.



\end{document}