four colour theorem
play

Four Colour Theorem Sebastian Wheeler Technische Universit at M - PowerPoint PPT Presentation

Aug 09, 2023 •231 likes •863 views

The Four Colour Theorem The proof Four Colour Theorem Sebastian Wheeler Technische Universit at M unchen 19.06.2018 Sebastian Wheeler Four Colour Theorem 1 / 48 The Four Colour Theorem The proof Table of Contents The Four Colour

  1. The Four Colour Theorem The proof Four Colour Theorem Sebastian Wheeler Technische Universit¨ at M¨ unchen 19.06.2018 Sebastian Wheeler Four Colour Theorem 1 / 48

  2. The Four Colour Theorem The proof Table of Contents The Four Colour Theorem 1 The proof 2 Structure of the proof Simplify the map Consider a minimal counterexample Correct Kempe’s mistake Unavoidability Sebastian Wheeler Four Colour Theorem 2 / 48

  3. The Four Colour Theorem The proof Table of Contents The Four Colour Theorem 1 The proof 2 Structure of the proof Simplify the map Consider a minimal counterexample Correct Kempe’s mistake Unavoidability Sebastian Wheeler Four Colour Theorem 3 / 48

  4. The Four Colour Theorem The proof Sebastian Wheeler Four Colour Theorem 4 / 48

  5. The Four Colour Theorem The proof Sebastian Wheeler Four Colour Theorem 5 / 48

  6. The Four Colour Theorem The proof Sebastian Wheeler Four Colour Theorem 6 / 48

  7. The Four Colour Theorem The proof Sebastian Wheeler Four Colour Theorem 7 / 48

  8. The Four Colour Theorem The proof Sebastian Wheeler Four Colour Theorem 8 / 48

  9. The Four Colour Theorem The proof Theorem (Four Colour Theorem) The regions of any simple planar map can be coloured with only four colours, in such a way that any two adjacent regions have different colours. Sebastian Wheeler Four Colour Theorem 9 / 48

  10. The Four Colour Theorem The proof Theorem (Four Colour Theorem) The regions of any simple planar map can be coloured with only four colours, in such a way that any two adjacent regions have different colours. Definition (Planar map, regions, simple map) A planar map is a set of pairwise disjoint subsets of the plane, called regions . A simple map is one whose regions are connected open sets. Sebastian Wheeler Four Colour Theorem 9 / 48

  11. The Four Colour Theorem The proof Definition (Adjacent regions) Two regions of a map are adjacent if their respective closures have a common point that is not a corner of the map. Sebastian Wheeler Four Colour Theorem 10 / 48

  12. The Four Colour Theorem The proof Definition (Adjacent regions) Two regions of a map are adjacent if their respective closures have a common point that is not a corner of the map. Definition (Corner) A point is a corner of a map iff it belongs to the closures of at least three regions. Sebastian Wheeler Four Colour Theorem 10 / 48

  13. The Four Colour Theorem The proof first proof (attempt) by Kempe in 1879 Sebastian Wheeler Four Colour Theorem 11 / 48

  14. The Four Colour Theorem The proof first proof (attempt) by Kempe in 1879 correct proof by Appel and Haken in 1976 Sebastian Wheeler Four Colour Theorem 11 / 48

  15. The Four Colour Theorem Structure of the proof The proof Unavoidability Table of Contents The Four Colour Theorem 1 The proof 2 Structure of the proof Simplify the map Consider a minimal counterexample Correct Kempe’s mistake Unavoidability Sebastian Wheeler Four Colour Theorem 12 / 48

  16. The Four Colour Theorem Structure of the proof The proof Unavoidability Definition (polygonal outline, polygonal map, face) A polygonal outline is the pairwise disjoint union of a finite number of open line segments, called edges, with a set of nodes that contains the endpoints of the edges. The regions of a finite polygonal planar map , called faces , are the connected components of the complement of a polygonal outline. Sebastian Wheeler Four Colour Theorem 13 / 48

  17. The Four Colour Theorem Structure of the proof The proof Unavoidability Figure: A general polygonal map Sebastian Wheeler Four Colour Theorem 14 / 48

  18. The Four Colour Theorem Structure of the proof The proof Unavoidability Figure: A general polygonal map Definition (polyhedral map) A polyhedral map is a finite bridgeless connected polygonal map. Sebastian Wheeler Four Colour Theorem 14 / 48

  19. The Four Colour Theorem Structure of the proof The proof Unavoidability Theorem (Euler formula) The Euler polyhedron formula (Euler 1752) V − E + F = 2 where V,E,F are the number of vertices, edges and faces, is valid for any schema which represents the sphere. Sebastian Wheeler Four Colour Theorem 15 / 48

  20. The Four Colour Theorem Structure of the proof The proof Unavoidability Table of Contents The Four Colour Theorem 1 The proof 2 Structure of the proof Simplify the map Consider a minimal counterexample Correct Kempe’s mistake Unavoidability Sebastian Wheeler Four Colour Theorem 16 / 48

  21. The Four Colour Theorem Structure of the proof The proof Unavoidability Table of Contents The Four Colour Theorem 1 The proof 2 Structure of the proof Simplify the map Consider a minimal counterexample Correct Kempe’s mistake Unavoidability Sebastian Wheeler Four Colour Theorem 17 / 48

  22. The Four Colour Theorem Structure of the proof The proof Unavoidability Figure: Reducing to cubic map Sebastian Wheeler Four Colour Theorem 18 / 48

  23. The Four Colour Theorem Structure of the proof The proof Unavoidability Figure: Reducing to cubic map 3 V = 2 E Sebastian Wheeler Four Colour Theorem 18 / 48

  24. The Four Colour Theorem Structure of the proof The proof Unavoidability Figure: Reducing to cubic map 3 V = 2 E V − E + F = 2 Sebastian Wheeler Four Colour Theorem 18 / 48

  25. The Four Colour Theorem Structure of the proof The proof Unavoidability Figure: Reducing to cubic map 3 V = 2 E V − E + F = 2 2 E = 6 F − 12 Sebastian Wheeler Four Colour Theorem 18 / 48

  26. The Four Colour Theorem Structure of the proof The proof Unavoidability Figure: Reducing to cubic map 3 V = 2 E V − E + F = 2 2 E F = 6 − 12 2 E = 6 F − 12 F Sebastian Wheeler Four Colour Theorem 18 / 48

  27. The Four Colour Theorem Structure of the proof The proof Unavoidability Table of Contents The Four Colour Theorem 1 The proof 2 Structure of the proof Simplify the map Consider a minimal counterexample Correct Kempe’s mistake Unavoidability Sebastian Wheeler Four Colour Theorem 19 / 48

  28. The Four Colour Theorem Structure of the proof The proof Unavoidability Figure: Possible shape and neighbourhood of the smaller face Sebastian Wheeler Four Colour Theorem 20 / 48

  29. The Four Colour Theorem Structure of the proof The proof Unavoidability Sebastian Wheeler Four Colour Theorem 21 / 48

  30. The Four Colour Theorem Structure of the proof The proof Unavoidability Sebastian Wheeler Four Colour Theorem 22 / 48

  31. The Four Colour Theorem Structure of the proof The proof Unavoidability Sebastian Wheeler Four Colour Theorem 23 / 48

  32. The Four Colour Theorem Structure of the proof The proof Unavoidability Sebastian Wheeler Four Colour Theorem 24 / 48

  33. The Four Colour Theorem Structure of the proof The proof Unavoidability Sebastian Wheeler Four Colour Theorem 25 / 48

  34. The Four Colour Theorem Structure of the proof The proof Unavoidability Sebastian Wheeler Four Colour Theorem 26 / 48

  35. The Four Colour Theorem Structure of the proof The proof Unavoidability Sebastian Wheeler Four Colour Theorem 27 / 48

  36. The Four Colour Theorem Structure of the proof The proof Unavoidability Sebastian Wheeler Four Colour Theorem 28 / 48

  37. The Four Colour Theorem Structure of the proof The proof Unavoidability Sebastian Wheeler Four Colour Theorem 29 / 48

  38. The Four Colour Theorem Structure of the proof The proof Unavoidability Sebastian Wheeler Four Colour Theorem 30 / 48

  39. The Four Colour Theorem Structure of the proof The proof Unavoidability Sebastian Wheeler Four Colour Theorem 31 / 48

  40. The Four Colour Theorem Structure of the proof The proof Unavoidability Sebastian Wheeler Four Colour Theorem 32 / 48

  41. The Four Colour Theorem Structure of the proof The proof Unavoidability Sebastian Wheeler Four Colour Theorem 33 / 48

  42. The Four Colour Theorem Structure of the proof The proof Unavoidability Sebastian Wheeler Four Colour Theorem 34 / 48

  43. The Four Colour Theorem Structure of the proof The proof Unavoidability Figure: Kempe chain Sebastian Wheeler Four Colour Theorem 35 / 48

  44. The Four Colour Theorem Structure of the proof The proof Unavoidability Figure: Kempe chain Sebastian Wheeler Four Colour Theorem 36 / 48

  45. The Four Colour Theorem Structure of the proof The proof Unavoidability Figure: Kempe chains splitting the colours Sebastian Wheeler Four Colour Theorem 37 / 48

  46. The Four Colour Theorem Structure of the proof The proof Unavoidability Figure: Counterexample to Kempe’s proof Sebastian Wheeler Four Colour Theorem 38 / 48

  47. The Four Colour Theorem Structure of the proof The proof Unavoidability Figure: Counterexample to Kempe’s proof Sebastian Wheeler Four Colour Theorem 39 / 48

  48. The Four Colour Theorem Structure of the proof The proof Unavoidability Figure: Counterexample to Kempe’s proof Sebastian Wheeler Four Colour Theorem 40 / 48

  49. The Four Colour Theorem Structure of the proof The proof Unavoidability Table of Contents The Four Colour Theorem 1 The proof 2 Structure of the proof Simplify the map Consider a minimal counterexample Correct Kempe’s mistake Unavoidability Sebastian Wheeler Four Colour Theorem 41 / 48

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

The Seven Colour Theorem Christopher Tuffley Institute of Fundamental Sciences Massey

The Seven Colour Theorem Christopher Tuffley Institute of Fundamental Sciences Massey

The Seven Colour Theorem Christopher Tuffley Institute of Fundamental Sciences Massey University, Palmerston North 3rd Annual NZMASP Conference, November 2008 Christopher Tuffley (Massey University) The Seven Colour Theorem November 2008 1 /

600 views • 44 slides
Colour Illusions Simultaneous colour contrast Animated versions... Neon Colour Spreading Colour

Colour Illusions Simultaneous colour contrast Animated versions... Neon Colour Spreading Colour

Colour Illusions Simultaneous colour contrast Animated versions... Neon Colour Spreading Colour Assimilation Benham's Top Chromatic Negative Afterimage Fixate on either of the two crosses; now fixate on the other cross. http://www.grand-

498 views • 18 slides
IN LIVING CO COLOUR: STUDYING THE EVOLUTION OF H HUMAN CO COLOUR P PREFERENCES Dr Larissa

IN LIVING CO COLOUR: STUDYING THE EVOLUTION OF H HUMAN CO COLOUR P PREFERENCES Dr Larissa

IN LIVING CO COLOUR: STUDYING THE EVOLUTION OF H HUMAN CO COLOUR P PREFERENCES Dr Larissa ssa Mendo doza Straff ffon Inte terdisciplin inary Col Colour Day Day An Antwerp 21/ 21/03/2017 4 QUESTIONS Why do humans have colour

627 views • 28 slides
The Ontology of Colour, from Colour for Philosophers Hardin Why

The Ontology of Colour, from Colour for Philosophers Hardin Why

The Ontology of Colour, from Colour for Philosophers Hardin Why should we accept colour irrealism? -Hardin suggest we should be irrealists about colour because

511 views • 30 slides
Aurora Colour Swatches/Palette Proposal Current vs. New colour swatches Aurora Borealis Colour

Aurora Colour Swatches/Palette Proposal Current vs. New colour swatches Aurora Borealis Colour

Aurora Colour Swatches/Palette Proposal Current vs. New colour swatches Aurora Borealis Colour Swatches -Main Aurora colour swatches -Evaluated the Aurora Borealis swatch, keeping that same clean and fresh look Monochrome -Creating palettes

459 views • 14 slides
Pythia and Colour Reconnections Peter Skands (Monash University) Colour Reconnections

Pythia and Colour Reconnections Peter Skands (Monash University) Colour Reconnections

Pythia and Colour Reconnections Peter Skands (Monash University) Colour Reconnections increasingly seen as part of broader spectrum of (non-perturbative) collective effects. New models. Shower Uncertainties in PYTHIA. Colour Connections

576 views • 34 slides
The right colour. The fjrst time. Every time. VIVO Colour Solutions Do you realize how much

The right colour. The fjrst time. Every time. VIVO Colour Solutions Do you realize how much

The right colour. The fjrst time. Every time. VIVO Colour Solutions Do you realize how much money your business waste on colour matching? Chances are you dont. Because if you did you would have done something about it. Or you would at

489 views • 12 slides
Theory of colour m easurem ent Contem porary w ool dyeing and finishing Dr Rex Brady Deakin

Theory of colour m easurem ent Contem porary w ool dyeing and finishing Dr Rex Brady Deakin

Theory of colour m easurem ent Contem porary w ool dyeing and finishing Dr Rex Brady Deakin University Colour m easurem ent theory Topics 1. How we see colour 2. Generation of colours 3. Measurement of colour 1 . How w e see colour W hat

4.09k views • 43 slides
Multimedia Systems - Colour Video Colour is a visual Presence and distributions of

Multimedia Systems - Colour Video Colour is a visual Presence and distributions of

Multimedia Systems - Colour Video Colour is a visual Presence and distributions of colours induce feature which is sensations and conveys immediately perceived meanings in the observer according to specific rules Joemon Jose

471 views • 8 slides
RAMSEY THEORY Ramsey Theory Ramseys Theorem Suppose we 2-colour the edges of K 6 of Red and

RAMSEY THEORY Ramsey Theory Ramseys Theorem Suppose we 2-colour the edges of K 6 of Red and

RAMSEY THEORY Ramsey Theory Ramseys Theorem Suppose we 2-colour the edges of K 6 of Red and Blue. There must be either a Red triangle or a Blue triangle. This is not true for K 5 . Ramsey Theory 2 R 3 R 1 R 4 5 6 There are 3 edges of

428 views • 24 slides
Colour an introduction Colour is... ...a powerful tool ...tied to religious, cultural,

Colour an introduction Colour is... ...a powerful tool ...tied to religious, cultural,

Colour an introduction Colour is... ...a powerful tool ...tied to religious, cultural, political and social influences It Affects Mood It Can Communicate It Has Cultural Significance It Has Political Associations Religion can also be

1.01k views • 78 slides
> ABOUT A CHAIR22 < De sign H e e We llin g & H AY > HAY COLOUR SELECTION 01 <

> ABOUT A CHAIR22 < De sign H e e We llin g & H AY > HAY COLOUR SELECTION 01 <

> ABOUT A CHAIR22 < De sign H e e We llin g & H AY > HAY COLOUR SELECTION 01 < Concrete grey Cream white Dusty blue Orange HAY > HAY COLOUR SELECTION 02 < Cream white Hunter Dusty green Warm red HAY > HAY COLOUR

582 views • 7 slides
31. Stokes Theorem Stokes theorem is to Greens theorem, for the work done, as the

31. Stokes Theorem Stokes theorem is to Greens theorem, for the work done, as the

31. Stokes Theorem Stokes theorem is to Greens theorem, for the work done, as the divergence theorem is to Greens theorem, for the flux. Both are 3D generalisations of 2D theorems. Theorem 31.1 (Stokes Theorem) . Let C be any closed

406 views • 3 slides
29. The divergence theorem Theorem 29.1 (Divergence Theorem; Gauss, Ostrogradsky) . Let S be a

29. The divergence theorem Theorem 29.1 (Divergence Theorem; Gauss, Ostrogradsky) . Let S be a

29. The divergence theorem Theorem 29.1 (Divergence Theorem; Gauss, Ostrogradsky) . Let S be a closed surface bounding a solid D , oriented outwards. Let F be a vector field with continuous partial derivatives. Then F d

471 views • 3 slides
What is colour? Eliminativism : The view that either (a) colours as we perceive them do not exist

What is colour? Eliminativism : The view that either (a) colours as we perceive them do not exist

What is colour? Eliminativism : The view that either (a) colours as we perceive them do not exist in nature, that is, there is no room for them in our scientific ontologies (error theory); or (b) while there is colour, nonetheless the particular

630 views • 35 slides
Kleenes Theorem 4-0 Kleenes Theorem Theorem For every language L (over

Kleenes Theorem 4-0 Kleenes Theorem Theorem For every language L (over

Griffith University 3130CIT Theory of Computation (Based on slides by Harald Sndergaard of The University of Melbourne) Kleenes Theorem 4-0 Kleenes Theorem Theorem For every language L (over a finite

422 views • 17 slides
Snarks that cannot be covered with four perfect matchings Edita M a cajov a Comenius

Snarks that cannot be covered with four perfect matchings Edita M a cajov a Comenius

Snarks that cannot be covered with four perfect matchings Edita M a cajov a Comenius University, Bratislava GGTW 2017, Ghent, August 2017 joint work with Martin Skoviera Edita M a cajov a (Bratislava) ... August 2017 1

1.11k views • 65 slides
Texts Complexity Theory The main text for the course is: Computational Complexity . Christos H.

Texts Complexity Theory The main text for the course is: Computational Complexity . Christos H.

Complexity Theory 1 Complexity Theory 2 Texts Complexity Theory The main text for the course is: Computational Complexity . Christos H. Papadimitriou. Introduction to the Theory of Computation . Michael Sipser. Anuj Dawar Other useful

628 views • 30 slides
List colourings of hypergraphs Andrew Thomason GT2015 24th August 2015 List colourings Let G be

List colourings of hypergraphs Andrew Thomason GT2015 24th August 2015 List colourings Let G be

List colourings of hypergraphs Andrew Thomason GT2015 24th August 2015 List colourings Let G be a graph or r -uniform hypergraph (edges are r -sets) Let L : V ( G ) P{ colours } assign a list of colours to each v G G is k-list-colourable

923 views • 50 slides
Duality, medial graphs and polynomials of embedded graphs Iain Moffatt joint with Jo

Duality, medial graphs and polynomials of embedded graphs Iain Moffatt joint with Jo

Duality, medial graphs and polynomials of embedded graphs Iain Moffatt joint with Jo Ellis-Monaghan BCC, St Andrews, 9 th July 2009 I. Moffatt (South Alabama) Medial graphs and twisted duals BCC 2009 1 / 12 Medial graphs is a (possibly

445 views • 29 slides
Topological containment of the 5-clique minus an edge in 4-connected graphs Rebecca Robinson

Topological containment of the 5-clique minus an edge in 4-connected graphs Rebecca Robinson

Topological containment of the 5-clique minus an edge in 4-connected graphs Rebecca Robinson (joint work with Graham Farr) Faculty of Information Technology Monash University (Clayton Campus) Monday 3 rd April, 2017 Monday 3 rd April, 2017 R.

445 views • 28 slides
Structure generation Generation of generalized cubic graphs N. Van Cleemput N. Van Cleemput

Structure generation Generation of generalized cubic graphs N. Van Cleemput N. Van Cleemput

Structure generation Generation of generalized cubic graphs N. Van Cleemput N. Van Cleemput Structure generation Exhaustive isomorph-free structure generation Create all structures from a given class of combinatorial structures without

535 views • 30 slides
The ecosystem around NP Evgenij Thorstensen V18 Evgenij Thorstensen The ecosystem around NP V18

The ecosystem around NP Evgenij Thorstensen V18 Evgenij Thorstensen The ecosystem around NP V18

The ecosystem around NP Evgenij Thorstensen V18 Evgenij Thorstensen The ecosystem around NP V18 1 / 16 The general picture We have P , NP and coNP , and then up there in the clouds PSPACE . Evgenij Thorstensen The ecosystem around NP V18 2

325 views • 16 slides
Countably categorical almost sure theories Ove Ahlman, Uppsala University ove@math.uu.se

Countably categorical almost sure theories Ove Ahlman, Uppsala University ove@math.uu.se

Countably categorical almost sure theories Ove Ahlman, Uppsala University ove@math.uu.se Countably categorical almost sure theories Ove Ahlman, Uppsala University Introduction A finite graph G = ( G , E ) is a finite set G with a binary

688 views • 26 slides

More recommend