A Classification of Planar Graphs - A Proof of Kuratowski's Theorem
Автор: Encanned Ingestible Beans
Загружено: 2021-08-21
Просмотров: 1725
Описание:
A visually explained proof of Kuratowski's theorem, an interesting, important and useful result classifying "planar" graphs.
Proof adapted from: http://math.uchicago.edu/~may/REU2017...
and: https://www.math.cmu.edu/~mradclif/te...
Also check this out!: https://arxiv.org/pdf/1709.04642.pdf
Animations created with Manim Community Edition: https://github.com/ManimCommunity/manim
Edited with OpenShot: https://www.openshot.org/
00:00 Introduction
00:42 Examples of nonplanar graphs
01:46 Statement of the Theorem
03:27 Why K_5 and K_{3,3} are nonplanar and Euler's identity
12:06 Plan for forward direction and hypothetical G
13:35 Important pattern and connectedness
18:19 G is 3-connected
23:30 Exterior bridges
27:18 Interior bridges and final casework
34:23 Finishing the proof
35:45 Credits
Повторяем попытку...
Доступные форматы для скачивания:
Скачать видео
-
Информация по загрузке:
![Цепи Маркова — математика предсказаний [Veritasium]](https://image.4k-video.ru/id-video/QI7oUwNrQ34)
