aboutsummaryrefslogtreecommitdiff
path: root/sections/introduction.tex
diff options
context:
space:
mode:
Diffstat (limited to 'sections/introduction.tex')
-rw-r--r--sections/introduction.tex4
1 files changed, 2 insertions, 2 deletions
diff --git a/sections/introduction.tex b/sections/introduction.tex
index 433f3e9..0605356 100644
--- a/sections/introduction.tex
+++ b/sections/introduction.tex
@@ -22,8 +22,8 @@
Rado graph), the Fraïssé limit of the class of finite undirected graphs.
It serves as a useful example, gives an intuition of the Fraïssé limits,
weak Hrushovski property and free amalgamation. Perhaps most importantly,
- the random graph has a so-called generic automorphism (DODAĆ DEFINICJĘ
- GENERYCZNEGO AUTOMORFIZMU I ZLINKOWAĆ TUTAJ), which was first proved
+ the random graph has a so-called generic automorphism
+ \ref{definition:generic_automorphism}, which was first proved
by Truss in \cite{truss_gen_aut}, where he also introduced the term.
The key theorem \ref{theorem:generic_aut_general}