Platonic graph

Platonic graphs and the Petersen graph

In this tutorial I show you to construct the five platonic graphs and the Peterson graph in Mathematica and we use some of the information in the previous lectures to look at some of the properties of these graphs, simply by looking at their graphical representation.

From playlist Introducing graph theory

Images in Math - Platonic Solids

This video is about the different platonic solids.

From playlist Images in Math

How to Construct a Dodecahedron

How the greeks constructed the Dodecahedron. Euclids Elements Book 13, Proposition 17. In geometry, a dodecahedron is any polyhedron with twelve flat faces. The most familiar dodecahedron is the regular dodecahedron with regular pentagons as faces, which is a Platonic solid. A regular dode

From playlist Platonic Solids

AlgTop9: Applications of Euler's formula and graphs

We use Euler's formula to show that there are at most 5 Platonic, or regular, solids. We discuss other types of polyhedra, including deltahedra (made of equilateral triangles) and Schafli's generalizations to higher dimensions. In particular in 4 dimensions there is the 120-cell, the 600-c

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

Planar graphs

Planar graphs, What are planar graphs? In this video we take a look at what a planar graph is and how Mathematica can check to see if a graph is planar. In short, a planar graph is one that can be drawn in the plane such that no edges cross. If you want to learn more about Mathematica,

From playlist Introducing graph theory

Perfect Shapes in Higher Dimensions - Numberphile

Carlo Sequin talks through platonic solids and regular polytopes in higher dimensions. More links & stuff in full description below ↓↓↓ Extra footage (Hypernom): https://youtu.be/unC0Y3kv0Yk More videos with with Carlo: http://bit.ly/carlo_videos Edit and animation by Pete McPartlan Pete

From playlist Carlo Séquin on Numberphile

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

How to construct a Regular Hexahedron (Cube)

How the greeks constructed the 3rd platonic solid: the regular hexahedron Source: Euclids Elements Book 13, Proposition 15 https://www.etsy.com/listing/1037552189/wooden-large-platonic-solids-geometry

From playlist Platonic Solids

Platonic and Archimedean solids

Platonic solids: http://shpws.me/qPNS Archimedean solids: http://shpws.me/qPNV

From playlist 3D printing

What is a Path Graph? | Graph Theory

What is a path graph? We have previously discussed paths as being ways of moving through graphs without repeating vertices or edges, but today we can also talk about paths as being graphs themselves, and that is the topic of today's math lesson! A path graph is a graph whose vertices can

From playlist Graph Theory

Live CEOing Ep 186: Polyhedra in Wolfram Language

Watch Stephen Wolfram and teams of developers in a live, working, language design meeting. This episode is about Polyhedra in the Wolfram Language.

From playlist Behind the Scenes in Real-Life Software Design

What is a Graph? | Graph Theory

What is a graph? A graph theory graph, in particular, is the subject of discussion today. In graph theory, a graph is an ordered pair consisting of a vertex set, then an edge set. Graphs are often represented as diagrams, with dots representing vertices, and lines representing edges. Each

From playlist Graph Theory

Karl Schaffer - Edgy Puzzles - G4G13 Apr 2018

Edge decompositions of polyhedra et al.

From playlist G4G13 Videos

What are Connected Graphs? | Graph Theory

What is a connected graph in graph theory? That is the subject of today's math lesson! A connected graph is a graph in which every pair of vertices is connected, which means there exists a path in the graph with those vertices as endpoints. We can think of it this way: if, by traveling acr

From playlist Graph Theory

Euler's relation between vertices, edges and faces of the Platonic solids 15 | Famous Math Problems

In this Famous Math Problem, we look at a question that the great Leonard Euler was the first to ask: what is the relation between the number of vertices, edges and faces of a Platonic solid? His resolution of this problem led to one of the most famous, and beautiful, formulas in mathemati

From playlist Famous Math Problems

Playing with Platonic and Archimedean Solids by Swati Sircar and Susy Varughese

SUMMER SCHOOL FOR WOMEN IN MATHEMATICS AND STATISTICS POPULAR TALKS (TITLE AND ABSTRACT) June 17, Friday, 15:45 - 16:45 hrs Swati Sircar (AzimPremji University, Bengaluru, India) Title: Playing with Platonic and Archimedean Solids Abstract: While the 5 Platonic solids are quite popular

From playlist Summer School for Women in Mathematics and Statistics - 2022

Anthony Henderson: Hilbert Schemes Lecture 4

SMRI Seminar Series: 'Hilbert Schemes' Lecture 4 Kleinian singularities 1 Anthony Henderson (University of Sydney) This series of lectures aims to present parts of Nakajima’s book `Lectures on Hilbert schemes of points on surfaces’ in a way that is accessible to PhD students interested i

From playlist SMRI Course: Hilbert Schemes

The remarkable Platonic solids I | Universal Hyperbolic Geometry 47 | NJ Wildberger

The Platonic solids have fascinated mankind for thousands of years. These regular solids embody some kind of fundamental symmetry and their analogues in the hyperbolic setting will open up a whole new domain of discourse. Here we give an introduction to these fascinating objects: the tetra

From playlist Universal Hyperbolic Geometry

Jon Pakianathan (5/7/19): On a canonical construction of tessellated surfaces from finite groups

Title: On a canonical construction of tessellated surfaces from finite groups Abstract: In this talk we will discuss an elementary construction that associates to the non-commutative part of a finite group’s multiplication table, a finite collection of closed, connected, oriented surfaces

From playlist AATRN 2019