List of small polyhedra by vertex count

Largest Possible Number of Edges for Various Types of Graphs

The video explains how to determine the maximum number of possible edges for various types of graphs. mathispower4u.com

From playlist Graph Theory (Discrete Math)

Polygonal Numbers - Geometric Approach & Fermat's Polygonal Number Theorem

I created this video with the YouTube Video Editor (http://www.youtube.com/editor)

From playlist ℕumber Theory

Introduction Polyhedra Using Euler's Formula

This video introduces polyhedra and how every convex polyhedron can be represented as a planar graph. mathispower4u.com

From playlist Graph Theory (Discrete Math)

Prove There Are Exactly 5 Regular Polyhedra

This video proves a proof that there are exactly 5 regular polyhedra. mathispower4u.com

From playlist Graph Theory (Discrete Math)

Geometry - Basic Terminology (11 of 34) Definition of Polygons and Convex Polygons

Visit http://ilectureonline.com for more math and science lectures! In this video I will define what are polygons and convex polygons. Next video in the Basic Terminology series can be seen at: http://youtu.be/N3wvmbsaFwQ

From playlist GEOMETRY 1 - BASIC TERMINOLOGY

Regular polyhedra

This shows a 3d print of a mathematical sculpture I produced using shapeways.com. This model is available at http://shpws.me/q0PF.

From playlist 3D printing

How to classify polygons by the measure of their angles

👉 Learn all about classifying triangles. A triangle is a closed figure with three sides. A triangle can be classified based on the length of the sides or based on the measure of the angles. To classify a triangle based on the length of the sides, we have: equilateral (3 sides are equal), i

From playlist Triangles

Classifying Polygons

http://mathispower4u.wordpress.com/

From playlist Geometry Basics

Polygons

Introduction of Polygons

From playlist Summer of Math Exposition Youtube Videos

AlgTop8: Polyhedra and Euler's formula

We investigate the five Platonic solids: tetrahedron, cube, octohedron, icosahedron and dodecahedron. Euler's formula relates the number of vertices, edges and faces. We give a proof using a triangulation argument and the flow down a sphere. This is the eighth lecture in this beginner's

From playlist Algebraic Topology: a beginner's course - N J Wildberger

Daniel Dadush: Probabilistic analysis of the simpler method and polytope diameter

In this talk, I will overview progress in our probabilistic understanding of the (shadow vertex) simplex method in three different settings: smoothed polytopes (whose data is randomly perturbed), well-conditioned polytopes (e.g., TU systems), and random polytopes with constraints drawn uni

From playlist Workshop: Tropical geometry and the geometry of linear programming

Geometry and arithmetic of sphere packings - Alex Kontorovich

Members' Seminar Topic: Geometry and arithmetic of sphere packings Speaker: A nearly optimal lower bound on the approximate degree of AC00 Speaker:Alex Kontorovich Affiliation: Rutgers University Date: October 23, 2017 For more videos, please visit http://video.ias.edu

From playlist Mathematics

Thin Groups and Applications - Alex Kontorovich

Analysis and Beyond - Celebrating Jean Bourgain's Work and Impact May 21, 2016 More videos on http://video.ias.edu

From playlist Analysis and Beyond

Illustrative Mathematics Grade 6 - Unit 1- Lesson 13

Illustrative Mathematics Grade 6 - Unit 1- Lesson 13 Open Up Resources (OUR) If you have any questions, please contact me at dhabecker@gmail.com

From playlist Illustrative Mathematics Grade 6 Unit 1

Lecture 18: Gluing Algorithms

MIT 6.849 Geometric Folding Algorithms: Linkages, Origami, Polyhedra, Fall 2012 View the complete course: http://ocw.mit.edu/6-849F12 Instructor: Erik Demaine This lecture begins with how to construct a gluing tree. Combinatorial bounds and algorithms are proved for gluing results, which

From playlist MIT 6.849 Geometric Folding Algorithms, Fall 2012

Lecture 16: Vertex & Orthogonal Unfolding

MIT 6.849 Geometric Folding Algorithms: Linkages, Origami, Polyhedra, Fall 2012 View the complete course: http://ocw.mit.edu/6-849F12 Instructor: Erik Demaine This lecture continues with open problems involving general unfoldings of polyhedra and proof of vertex unfolding using constructi

From playlist MIT 6.849 Geometric Folding Algorithms, Fall 2012

Lecture 17: Alexandrov's Theorem

MIT 6.849 Geometric Folding Algorithms: Linkages, Origami, Polyhedra, Fall 2012 View the complete course: http://ocw.mit.edu/6-849F12 Instructor: Erik Demaine This lecture addresses the mathematical approaches for solving the decision problem for folding polyhedra. A proof of Alexandrov's

From playlist MIT 6.849 Geometric Folding Algorithms, Fall 2012

Math Mornings at Yale: Asher Auel - Wallpaper, Platonic Solids, and Symmetry

The Platonic solids-the tetrahedron, cube, octahedron, dodecahedron, and icosahedron-are some of the most beautiful and symmetric geometrical objects in 3-dimensional space. Their mysteries started to be unraveled by the ancient Greeks and still fascinate us today. In 1872, the German geom

From playlist Math Mornings at Yale

Introduction to Polygons

http://mathispower4u.wordpress.com/

From playlist Geometry Basics

Lecture 1: Overview

MIT 6.849 Geometric Folding Algorithms: Linkages, Origami, Polyhedra, Fall 2012 View the complete course: http://ocw.mit.edu/6-849F12 Instructor: Erik Demaine This lecture introduces the topics covered in the course and its motivation. Examples of applications are provided, types and char

From playlist MIT 6.849 Geometric Folding Algorithms, Fall 2012