Search results

This following is a '''list of [[lemma (mathematics)|lemmas]]''' (or, "'''lemmata'''", i.e. minor [[theorem]]s, or sometimes intermedia {{Main category|Lemmas in algebra}} ...

{{Short description|Influence of local substructure of a graph on global properties}} ...or a graph on ''n'' vertices without (''r'' + 1)-[[clique (graph theory)|cliques]]. This is ''T''(13,4).]] ...

...f edges between them in a [[random graph|random]] <math>d</math>-[[regular graph]], namely <math>\frac dn|S||T|</math>. ...adjacency matrix]] will never exceed the maximum degree of <math>G</math> in absolute value. ...

...more general version of [[Zassenhaus lemma|Zassenhaus' butterfly lemma]]. In this form, Goursat's lemma also implies the [[snake lemma]] {{Citation need ...ath>H</math> in <math>G/N \times G'/N'</math> is the [[graph of a function|graph]] of an [[group isomorphism|isomorphism]] <math>G/N \cong G'/N'</math>. One ...

...statistics)|sampling]] [[vertex (graph theory)|vertices]] in an [[expander graph]] by doing relatively short [[Random walk#On graphs|random walk]] can simul Let <math>G=(V,E)</math> be an n-vertex [[expander graph]] with positively weighted edges, and let <math>A\subset V</math>. Let <mat ...

...eorem also has important roles in [[constructive mathematics]] and [[proof theory]]. ...Then <math>G</math> contains a [[Ray (graph theory)|ray]]: a [[path (graph theory)|simple path]] (a path with no repeated vertices) that starts at one vertex ...

{{short description|Ideals in a Boolean algebra can be extended to prime ideals}} ...[[order theory]]). This article focuses on prime ideal theorems from order theory. ...

...and Their Application to Computer Science and Biology|series=Lecture Notes in Computer Science |volume=73 |language=en |location=Berlin, Heidelberg |publ ...stel/ Aaron Berstel's website)</ref> such that every string <math>s</math> in <math>L</math> that has a [[string length|length]] of <math>p</math> or mor ...

{{Short description|Concept in extremal graph theory}} ...ng|alt=regularity partition|thumb|280x280px|The edges between parts behave in a "random-like" fashion.]] ...

...ematical articles. This article brings together the same content organized in a manner better suited for browsing. ...and ''[[Zentralblatt MATH]]''. This list has some items that would not fit in such a classification, such as [[list of exponential topics]] and [[list of ...

{{Short description|Theorem on triangulation graph colorings}} {{For|the theorem in extremal set theory|Sperner's theorem}} ...

| caption = Szemerédi in 2014 ...|url-status=dead}}</ref> mathematician and [[computer scientist]], working in the field of [[combinatorics]] and [[theoretical computer science]]. He has ...

...occurs. This lemma is most commonly used in the [[probabilistic method]], in particular to give [[nonconstructive proof|existence proofs]]. ...]] to provide an efficient [[randomized algorithm]] for finding an outcome in which none of the events occurs.<ref>{{Cite web|url=https://ethz.ch/en/the- ...

In [[mathematics]], an '''involution''', '''involutory function''', or '''self for all {{mvar|x}} in the [[domain of a function|domain]] of {{math|''f''}}.<ref>{{citation|last= ...

..., the '''amicable numbers''' are two different [[natural number]]s related in such a way that the [[addition|sum]] of the [[proper divisor]]s of each is ...r]], which is a number that equals the sum of ''its own'' proper divisors, in other words a number which forms an aliquot sequence of period 1. Numbers t ...

{{short description|Sparse graph with strong connectivity}} ...heory|complexity theory]], design of robust [[computer network]]s, and the theory of [[error-correcting code]]s.<ref name="Hoory 2006">{{harvtxt|Hoory|Linial ...

| caption = Matches set up in rows for a game of Nim. Players take turns to choose a row and remove any n '''Nim''' is a [[mathematical game|mathematical]] [[combinatorial game]] in which two players take turns removing (or "nimming") objects from distinct ...

...lists the number of results for a [[Google Scholar]] search for the term, in double quotes {{as of|lc=y|September 2022}}. |[[1/3–2/3 conjecture]]||order theory|| ||n/a || 70 ...

...nk=Jean-Pierre Serre|page=23|publisher=Springer|series=Springer Monographs in Mathematics|year=2003}}</ref> Zorn's lemma is not needed for finite graphs, ...rtially ordered set]] containing [[upper bound]]s for every [[chain (order theory)|chain]] (that is, every [[total order|totally ordered]] [[subset]]) [[Nece ...

*[[List of derivatives and integrals in alternative calculi]] *[[List of lemmas]] ...