What is Sperner's Lemma and how does it relate to Graph Theory? [Discrete Mathematics]
What is Sperner's Lemma? This video will explain Sperner's Lemma and its relation to graph theory.
Sperner's Lemma is an important combinatorial result that has applications to many area of mathematics. It has been used in root-finding algorithms and computing fixed points. Sperner's Lemma relates to graph colorings, triangulations (the subdivision of shapes into triangles) and simplices, or triangles generalized to any dimension. In this video, we will focus primarily on the 2-dimensional case of Sperner's Lemma, but it has been generalized to triangles of any dimension. Sperner's Lemma states that if you start with a triangulation of a triangle and then color its vertices according to a few rules (called a Sperner coloring), then some triangle within the triangulation will be properly colored, or in other words, each vertex of that triangle will have a unique color.
Here are some links for more information:
http://discretemath.imp.fu-berlin.de/DMII-2019-20/Sperner.pdf
https://en.wikipedia.org/wiki/Sperner%27s_lemma
https://www.theoremoftheday.org/Topology/Sperner/TotDSperner.pdf
http://math.mit.edu/~fox/MAT307-lecture03.pdf
https://twocents.lifehacker.com/use-sperner-s-lemma-to-split-rent-fairly-1585414761
--------------------------------- Recommended Books ---------------------------------
********************************* Hypergraph Theory *********************************
"Hypergraph Theory: An Introduction": https://amzn.to/43bC8h1
"Introduction to Graph and Hypergraph Theory": https://amzn.to/3Ij9Poz
********************************* Graph Theory *********************************
"Introduction to Graph Theory (Trudeau)": https://amzn.to/43e2gHR
"Graph Theory (Diestel)": https://amzn.to/3OuLxfw
"The Fascinating World of Graph Theory": https://amzn.to/3pSUFQB
********************************* Other Mathematics *********************************
Discrete Mathematics with Applications (Epp): https://amzn.to/3MBXzkL
A Book of Abstract Algebra (Pinter): https://amzn.to/3On2jgp
Language, Proof and Logic: https://amzn.to/3Oi68n6
Linear Algebra and Its Applications: https://amzn.to/3MhvM91
All the Math You Missed: https://amzn.to/42FqOK5
These are my Amazon Affiliate links. As an Amazon Associate I may earn commisions for purchases made through the links above.
Видео What is Sperner's Lemma and how does it relate to Graph Theory? [Discrete Mathematics] канала Vital Sine
Sperner's Lemma is an important combinatorial result that has applications to many area of mathematics. It has been used in root-finding algorithms and computing fixed points. Sperner's Lemma relates to graph colorings, triangulations (the subdivision of shapes into triangles) and simplices, or triangles generalized to any dimension. In this video, we will focus primarily on the 2-dimensional case of Sperner's Lemma, but it has been generalized to triangles of any dimension. Sperner's Lemma states that if you start with a triangulation of a triangle and then color its vertices according to a few rules (called a Sperner coloring), then some triangle within the triangulation will be properly colored, or in other words, each vertex of that triangle will have a unique color.
Here are some links for more information:
http://discretemath.imp.fu-berlin.de/DMII-2019-20/Sperner.pdf
https://en.wikipedia.org/wiki/Sperner%27s_lemma
https://www.theoremoftheday.org/Topology/Sperner/TotDSperner.pdf
http://math.mit.edu/~fox/MAT307-lecture03.pdf
https://twocents.lifehacker.com/use-sperner-s-lemma-to-split-rent-fairly-1585414761
--------------------------------- Recommended Books ---------------------------------
********************************* Hypergraph Theory *********************************
"Hypergraph Theory: An Introduction": https://amzn.to/43bC8h1
"Introduction to Graph and Hypergraph Theory": https://amzn.to/3Ij9Poz
********************************* Graph Theory *********************************
"Introduction to Graph Theory (Trudeau)": https://amzn.to/43e2gHR
"Graph Theory (Diestel)": https://amzn.to/3OuLxfw
"The Fascinating World of Graph Theory": https://amzn.to/3pSUFQB
********************************* Other Mathematics *********************************
Discrete Mathematics with Applications (Epp): https://amzn.to/3MBXzkL
A Book of Abstract Algebra (Pinter): https://amzn.to/3On2jgp
Language, Proof and Logic: https://amzn.to/3Oi68n6
Linear Algebra and Its Applications: https://amzn.to/3MhvM91
All the Math You Missed: https://amzn.to/42FqOK5
These are my Amazon Affiliate links. As an Amazon Associate I may earn commisions for purchases made through the links above.
Видео What is Sperner's Lemma and how does it relate to Graph Theory? [Discrete Mathematics] канала Vital Sine
Показать
Комментарии отсутствуют
Информация о видео
Другие видео канала
![Hypergraph Strong Colorings [Hypergraph Theory Ep. 14]](https://i.ytimg.com/vi/2uz9CNHM1dQ/default.jpg)
![Hypergraph Coloring [Hypergraph Theory Ep. 13]](https://i.ytimg.com/vi/plqtIpRKBRs/default.jpg)
![Percolation Centrality [Network Theory] #SoME3](https://i.ytimg.com/vi/9l6W9ldvAng/default.jpg)
![Hypergraph Isomorphism [Hypergraph Theory Ep. 12]](https://i.ytimg.com/vi/AyuMVVMw7QQ/default.jpg)
![Graph Percolation Process](https://i.ytimg.com/vi/TDzu2M70p-0/default.jpg)
![Network Percolation Example #shorts](https://i.ytimg.com/vi/QvYOlg3MWUs/default.jpg)
![Construction of (r, g)-Graphs [Graph Theory]](https://i.ytimg.com/vi/l4dThe0G_mM/default.jpg)
![Graph Cartesian Product of Simplex Graphs [Graph Theory]](https://i.ytimg.com/vi/H80BJmeZVMs/default.jpg)
![How to Reverse the Simplex Graph Operation](https://i.ytimg.com/vi/Apu0KJNyoPo/default.jpg)
![Hypergraph Cartesian Product [Hypergraph Theory, Ep. 11]](https://i.ytimg.com/vi/u1vp88bglAc/default.jpg)
![Conformal Hypergraphs [Hypergraph Theory Episode 10]](https://i.ytimg.com/vi/cmn9Dlb4LME/default.jpg)
![Helly Property for Hypergraphs (Hypergraph Episode 7)](https://i.ytimg.com/vi/xIlAgsFbMkw/default.jpg)
![Guide to Hypergraph Walks, Trails, and Paths [Hypergraph Episode 6]](https://i.ytimg.com/vi/G9TkLOTftms/default.jpg)
![What are Projections and Layers in Graph Products? [Graph Theory]](https://i.ytimg.com/vi/ZzLeClbfgSk/default.jpg)
![What are Clique Complexes? [Hypergraph Episode 9]](https://i.ytimg.com/vi/Aoh4haV7Ekc/default.jpg)
![Intro to Abstract Simplicial Complexes and Hypergraph Perspective [Hypergraph Episode 8]](https://i.ytimg.com/vi/Q9cqKEmzFh4/default.jpg)
![Intro to P-sum, Extended P-sum, and NEPS of Graphs [Graph Theory]](https://i.ytimg.com/vi/Cn5St97ODas/default.jpg)
![Introduction to Line Graphs and 2-sections (Hypergraph Episode 5)](https://i.ytimg.com/vi/K_zBFZy_hq0/default.jpg)
![Overview of Hypergraph Parameters [Hypergraphs Episode 4]](https://i.ytimg.com/vi/7vPet6ijwco/default.jpg)
![Hypergraph Operations (Hypergraph Episode 3)](https://i.ytimg.com/vi/odr_P0EDTPY/default.jpg)
![What are Collinearity Graphs? [Incidence Geometry Ep. 3]](https://i.ytimg.com/vi/u66qG7EErAo/default.jpg)