From ff203523c63c7fb26265157fa07a4c9bff327e57 Mon Sep 17 00:00:00 2001
From: Martin Mares <mj@ucw.cz>
Date: Wed, 17 Jul 2019 13:26:32 +0200
Subject: [PATCH] =?UTF-8?q?en/example.tex=20u=C5=BE=20d=C3=A1vno=20nebyl?=
 =?UTF-8?q?=20aktu=C3=A1ln=C3=AD?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 en/example.tex | 46 ----------------------------------------------
 1 file changed, 46 deletions(-)
 delete mode 100644 en/example.tex

diff --git a/en/example.tex b/en/example.tex
deleted file mode 100644
index d0c33e6..0000000
--- a/en/example.tex
+++ /dev/null
@@ -1,46 +0,0 @@
-%%% Ukázka použití některých konstrukcí LaTeXu
-
-\subsection{Ukázka \LaTeX{}u}
-\label{ssec:ukazka}
-
-This short subsection serves as an~example of basic \LaTeX{} constructs,
-which can be useful for writing a~thesis.
-
-Let us start with lists:
-
-\begin{itemize}
-\item The logo of Matfyz is displayed in figure~\ref{fig:mff}.
-\item This is subsection~\ref{ssec:ukazka}.
-\item Citing literature~\cite{lamport94}.
-\end{itemize}
-
-Different kinds of dashes:
-red-black (short),
-pages 16--22 (middle),
-$45-44$ (minus),
-and this is --- as you could have expected --- a~sentence-level dash,
-which is the longest.
-(Note that we have follwed \verb|a| by a~tilde instead of a~space
-to avoid line breaks at that place.)
-
-\newtheorem{theorem}{Theorem}
-\newtheorem*{define}{Definition}	% Definice nečíslujeme, proto "*"
-
-\begin{define}
-A~{\sl Tree} is a connected graph with no cycles.
-\end{define}
-
-\begin{theorem}
-This theorem is false.
-\end{theorem}
-
-\begin{proof}
-False theorems do not have proofs.
-\end{proof}
-
-\begin{figure}
-	\centering
-	\includegraphics[width=30mm]{../img/logo.eps}
-	\caption{Logo of MFF UK}
-	\label{fig:mff}
-\end{figure}