König's theorem

König's theorem

There are several theorems with the name König's theorem:

* König's theorem (set theory), named after the Hungarian mathematician Julius König
* König's theorem (graph theory), named after his son Dénes Kőnig
* König's theorem (kinetics), named after the German mathematician Samuel König

ee also

* König's lemma (also known as König's infinity lemma), named after Dénes Kőnig


Wikimedia Foundation. 2010.

Игры ⚽ Нужен реферат?

Look at other dictionaries:

  • König's theorem (kinetics) — Konig s theorem is related to kinetics of a system of particles. The theorem It states that the kinetic energy of a system of particles is the kinetic energy associated to the movement of the center of mass and the kinetic energy associated of… …   Wikipedia

  • König's theorem (graph theory) — In the mathematical area of graph theory, König s theorem describes an equivalence between the maximum matching problem and the minimum vertex cover problem in bipartite graphs. Setting A graph is bipartite if its vertices can be partitioned into …   Wikipedia

  • König's theorem (set theory) — For other uses, see König s theorem. In set theory, König s theorem (named after the Hungarian mathematician Gyula König) colloquially states that if the axiom of choice holds, I is a set, mi and ni are cardinal numbers for every i in I , and m i …   Wikipedia

  • König — is the German language word for King . Family names derived from König are also spelled without the umlaut ö as Koenig or without correct transliteration of the umlaut just as Konig. People named König or Konig *Arthur König (1856 1901), German… …   Wikipedia

  • König's lemma — or König s infinity lemma is a theorem in graph theory due to Dénes Kőnig (1936). It gives a sufficient condition for an infinite graph to have an infinitely long path. The computability aspects of this theorem have been thoroughly investigated… …   Wikipedia

  • Dilworth's theorem — In mathematics, in the areas of order theory and combinatorics, Dilworth s theorem characterizes the width of any finite partially ordered set in terms of a partition of the order into a minimum number of chains. It is named for the mathematician …   Wikipedia

  • Hall's marriage theorem — In mathematics, Hall s marriage theorem is a combinatorial result that gives the condition allowing the selection of a distinct element from each of a collection of finite sets. It was proved by Philip Hall (1935). Contents 1 Definitions and …   Wikipedia

  • Marriage theorem — In mathematics, the marriage theorem (1935), usually credited to mathematician Philip Hall, is a combinatorial result that gives the condition allowing the selection of a distinct element from each of a collection of subsets.Formally, let S = { S …   Wikipedia

  • Easton's theorem — In set theory, Easton s theorem is a result on the possible cardinal numbers of powersets. W. B. harvtxt|Easton|1970 (extending a result of Robert M. Solovay) showed via forcing that : kappa < operatorname{cf}(2^kappa),and, for kappale lambda,,… …   Wikipedia

  • Dénes Kőnig — Born September 21, 1884(1884 09 21) Budapest …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”