diff options
| author | Franciszek Malinka <franciszek.malinka@gmail.com> | 2022-07-09 14:50:30 +0200 |
|---|---|---|
| committer | Franciszek Malinka <franciszek.malinka@gmail.com> | 2022-07-09 14:50:30 +0200 |
| commit | 78636273b73556313468caf37a938a8a408e4b59 (patch) | |
| tree | f4a0839ce067299914b6a2b1f22f1d0a91e63dec /sections/introduction.tex | |
| parent | e55ffead297fd04fe73e5f7bd6d05a151450fb99 (diff) | |
Corrects to preliminaries
Diffstat (limited to 'sections/introduction.tex')
| -rw-r--r-- | sections/introduction.tex | 4 |
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} |