deletions | additions       diff --git a/section_Convergence_label_sec_convergence__.tex b/section_Convergence_label_sec_convergence__.tex  index bb283a6..d16b457 100644  --- a/section_Convergence_label_sec_convergence__.tex  +++ b/section_Convergence_label_sec_convergence__.tex 
...
A set of nodes $S\subseteq \N$ is said to be:  %\begin{itemize}[noitemsep]  \begin{itemize}  \item[]\emph{a cycle in $G$} if there is a path of length $|S|$  containing all and only elements of $S$ which is a cycle, \item[]\emph{connected} if for any $i , j \in S$: $i R^{*}j$,   \item[] \emph{strongly connected} if for any $i,j \in S$: there is a path $\tuple{i,\dots, j}$,   \item[]\emph{closed} if for any $i\in S$, $j \notin S$, it is not the case that $iRj$,