\documentclass[12pt]{article}
\usepackage{amsmath,mathrsfs,bbm}
\usepackage{amssymb}
\textwidth=4.825in
\overfullrule=0pt
\thispagestyle{empty}
\begin{document}
\noindent
%
%
{\bf P\'eter Csikv\'ari}
%
%
\medskip
\noindent
%
%
{\bf Applications of the Kelmans Transformation: Extremality of the Threshold Graphs}
%
%
\vskip 5mm
\noindent
%
%
%
%
In this paper we study various extremal problems related to
some combinatorially defined graph polynomials such as matching polynomial,
chromatic polynomial, Laplacian polynomial. It will turn out that many
problems attain its extremal value in the class of threshold graphs. To
attack these kinds of problems we survey several applications of the
so-called Kelmans transformation.
\end{document}