Kempe chain

Kempe chain

In mathematics, a Kempe chain is a device used mainly in the study of the four colour theorem.

History

Kempe chains were first used by Alfred Kempe in his attempted proof of the four colour theorem. Even though his proof turned out to be incorrect, the method of Kempe chains is crucial to the successful modern proofs (Appel & Haken, Robertson et al, etc). Furthermore, the method is used in the proof of the five colour theorem, a weaker form of the four colour theorem.

Formal definition

The term "Kempe chain" is used in two different but related ways.

Suppose "G" is a graph with vertex set "V", and we are given a colouring function: c : V o Swhere "S" is a finite set of colours, containing at least two distinct colours "a" and "b". If "v" is a vertex with colour "a", then the ("a", "b")-Kempe chain of "G" containing "v" is the maximal connected subset of "V" which contains "v" and whose vertices are all coloured either "a" or "b".

The above definition is what Kempe worked with. Typically the set "S" has four elements (the four colours of the four colour theorem), and "c" is a proper colouring, that is, each pair of adjacent vertices in "V" are assigned distinct colours.

A more general definition, which is used in the modern computer-based proofs of the four colour theorem, is the following. Suppose again that "G" is a graph, with edge set "E", and this time we have a colouring function: c : E o S.If "e" is an edge assigned colour "a", then the ("a", "b")-Kempe chain of "G" containing "e" is the maximal connected subset of "E" which contains "e" and whose edges are all coloured either "a" or "b".

This second definition is typically applied where "S" has three elements, say "a", "b" and "c", and where "V" is a cubic graph, that is, every vertex has three incident edges. If such a graph is properly coloured, then each vertex must have edges of three distinct colours, and Kempe chains end up being paths, which is simpler than in the case of the first definition.

In terms of maps

Application to the four colour theorem


Wikimedia Foundation. 2010.

Игры ⚽ Поможем сделать НИР

Look at other dictionaries:

  • Alfred Kempe — Infobox Scientist name = Sir Alfred Kempe box width = image width = caption = birth date = birth date|1849|07|07 birth place = Kensington, London, England death date = death date and age|1922|04|21|1849|07|06 death place = London, England… …   Wikipedia

  • Four color theorem — Example of a four colored map A four colori …   Wikipedia

  • Kemp — or Kempe may refer to: People * Alfred Bray Kempe, English mathematician * Carl Kempe, Swedish paper producer * Charles Eamer Kempe, Victorian stained glass designer * David Kemp (Australian politician), House of Representitives (see also his… …   Wikipedia

  • Edge coloring — A 3 edge coloring of the Desargues graph. In graph theory, an edge coloring of a graph is an assignment of “colors” to the edges of the graph so that no two adjacent edges have the same color. For example, the figure to the right shows an edge… …   Wikipedia

  • List of mathematics articles (K) — NOTOC K K approximation of k hitting set K ary tree K core K edge connected graph K equivalence K factor error K finite K function K homology K means algorithm K medoids K minimum spanning tree K Poincaré algebra K Poincaré group K set (geometry) …   Wikipedia

  • Linkage (mechanical) — This article is about assemblies of links designed to manage forces and movement. For other uses, see Linkage. Variable stroke engine (Autocar Handbook, Ninth edition) A mechanical linkage is an assembly of bodies connected together to manage… …   Wikipedia

  • combinatorics — /keuhm buy neuh tawr iks, tor , kom beuh /, n. (used with singular v.) See combinatorial analysis. * * * Branch of mathematics concerned with the selection, arrangement, and combination of objects chosen from a finite set. The number of possible… …   Universalium

  • Lord Chamberlain's Men — The Lord Chamberlain s Men was a playing company for whom Shakespeare worked for most of his career. Formed at the end of a period of flux in the theatrical world of London, it had become, by 1603, one of the two leading companies of the city and …   Wikipedia

  • Berlin Wall — For the chess opening variation, sometimes known as Berlin Wall, see Berlin Defence. View from the West Berlin side of graffiti art on the wall in 1986. The wall s infa …   Wikipedia

  • Озеро Ван — Ван тур. Van Gölü; арм. Վանա լիճ; курдск. Gola Wanê; араб. وان‎‎; осм. وان كولى Вид на озеро Ван из космоса …   Википедия

Share the article and excerpts

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