deletions | additions       diff --git a/This_example_shows_that_direction__.tex b/This_example_shows_that_direction__.tex  index 56e2524..4817493 100644  --- a/This_example_shows_that_direction__.tex  +++ b/This_example_shows_that_direction__.tex 
...
Let $\G$ be an influence profile, $\O$ be an opinion profile, and $\C$ a set of constraints. Then the following holds:  \begin{enumerate}  \item[] If for all $p\in \Atoms$, for all $S\subseteq\N$ such that $S$ is a cycle in $G_{p}$, and all $i,j\in S$: $O_i(p)=O_j(p)$, then  \item[] the resistant BDP for $\O$, $\G$ and $\C$ converges in at most $k$ steps, where $k=max\{diam(G_p)|p\in $k\seq max\{diam(G_p)|p\in  P\}$. \end{enumerate}  \end{theorem}