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.
उदाहरण · 6 - 2
चरणद्वारा चरण
- -2 + 6 = 4
Add: -2 + 6 = 4.
जवाफ प्रकट गर्नुहोस्
अब तपाईँ समस्या रोज्नुहोस्, वा टाइप गर्नुहोस् वा तपाईँको आफ्नै रेखाचित्र गर्नुहोस् । प्रत्येक चरण, एउटा तस्वीर, तपाईँले सोध्नु अघि उत्तर लुकेको छ ।
एक निःशुल्क खाता प्रत्येक पाठ मा नोट थप्छ, तपाईं के समाप्त गरेको छ को एक रेकर्ड, एक ठाउँमा आफ्नो समाधान समस्या, र एक शिक्षक तपाईं यो पृष्ठ बारेमा सोध्न सक्नुहुन्छ. गणित आफैलाई सबैलाई खुला छ, मा साइन इन वा छैन.
साइन अप गर्नुहोस् लगइनयहाँ प्रयोग गरिएको प्रतीक
पूर्ण परिभाषा, एउटा तस्वीर, र यो प्रत्येक अक्षर अर्थ के लागि कुनै पनि प्रतीक ट्याप गर्नुहोस्।
कसरी: Colouring and planar graphs
- Add: -2 + 6 = 4.
प्रश्नहरू मानिसहरूले सोध्छन्
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.
यसमा थप 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