From 05b8f5e35cc5604f872ea937364f107375a1fd89 Mon Sep 17 00:00:00 2001 From: Gloria Mundi Date: Sun, 17 Nov 2024 09:43:08 +0100 Subject: give Turán his acute accent MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- content/other/other.tex | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) (limited to 'content') diff --git a/content/other/other.tex b/content/other/other.tex index 153fc2d..2519427 100644 --- a/content/other/other.tex +++ b/content/other/other.tex @@ -211,7 +211,7 @@ Falls $x \leq y$, füge Kante $u_x \to v_y$ hinzu. Wenn Matching zu langsam ist, versuche Struktur des Posets auszunutzen und evtl. anders eine maximale Antikette zu finden. - \item \textbf{\textsc{Turan}'s Theorem:} + \item \textbf{\textsc{Tur\'an}'s Theorem:} Die Anzahl an Kanten in einem Graphen mit $n$ Knoten der keine clique der größe $x+1$ enthält ist: \begin{align*} ext(n, K_{x+1}) &= \binom{n}{2} - \left[\left(x - (n \bmod x)\right) \cdot \binom{\floor{\frac{n}{x}}}{2} + \left(n\bmod x\right) \cdot \binom{\ceil{\frac{n}{x}}}{2}\right] -- cgit v1.2.3