maths.free › Combinatorics & Graph Theory › Colouring and planar graphs

Colouring and planar graphs

Chromatic number, Euler's formula V − E + F = 2, and the four-colour theorem.

Colour vertices so neighbours differ; the fewest colours needed is the chromatic number. For a planar graph V − E + F = 2, which bounds edges by 3V − 6 and shows K₅ is not planar. Picture it: any map needs at most four colours, proven with a computer in 1976. Think it: Euler's formula is the Euler characteristic, the same invariant that distinguishes a sphere from a torus.

Vinna dæmi · 6 - 2

Arithmetic · Arithmetic

Evaluate 6 - 2

6 - 2

Skref fyrir skref

  1. -2 + 6 = 4

    Add: -2 + 6 = 4.

Sýna svarið
4

Núna ūú Veldu vandamál, eða sláðu inn eða teikna eigin. Hvert skref, mynd, svarið falið þar til þú spyrð.

Haltu eigin vinnu þinni

Ókeypis reikningur bætir við athugasemdum við hverja kennslustund, skrá yfir það sem þú hefur lokið, leyst vandamál á einum stað og kennari sem þú getur spurt um þessa síðu.Stærðfræðin sjálf er opin öllum, skráður inn eða ekki.

Skráðu þig inn Innskráning

Tákn notuð hér

Pikkaðu á hvaða tákn sem er fyrir fulla skilgreiningu, mynd og hvað hvert bréf í því merkir.

Hvernig á að nota: Colouring and planar graphs

  1. Add: -2 + 6 = 4.

Spurningar sem fólk spyr

Permutation or combination?

Ask whether order matters. A lock code is a permutation (order matters); a hand of cards is a combination (it does not).

What is a graph in this sense?

Dots (vertices) joined by lines (edges), not a plot. Road maps, social networks and molecules are graphs; questions like "is there a route" and "how few colours" are graph theory.

Meira í Combinatorics & Graph Theory

The counting principlesPigeonhole principle and inclusion, exclusionBinomial coefficients and Pascal's triangleRecurrences and generating functionsGraphs: vertices, edges, degreesPaths, cycles, trees, Euler and Hamilton