Regular graphs | Individual graphs
Wagner graph
In the mathematical field of graph theory, the Wagner graph is a 3-regular graph with 8 vertices and 12 edges. It is the 8-vertex Möbius ladder graph. (Wikipedia).
Regular graphs | Individual graphs
In the mathematical field of graph theory, the Wagner graph is a 3-regular graph with 8 vertices and 12 edges. It is the 8-vertex Möbius ladder graph. (Wikipedia).
Simple Definition of Petersen Graph | Graph Theory
We introduce the Petersen graph via a combinatorial definition using subsets. This definition of the Petersen graph is easy to understand and useful for proving various results about the graph. #GraphTheory A Petersen graph's vertices can be labeled by all two element subsets from a five
From playlist Graph Theory
From playlist 3d graphs
This shows a 3d print of a mathematical sculpture I produced using shapeways.com. This model is available at http://shpws.me/2toQ.
From playlist 3D printing
Graph of x^2 + 6xb + 5b^2 as b varies
From playlist 3d graphs
Graph Theory: 62. Graph Minors and Wagner's Theorem
In this video, we begin with a visualisation of an edge contraction and discuss the fact that an edge contraction may be thought of as resulting in a multigraph or simple graph, depending on the application. We then state the definition a contraction of edge e in a graph G resulting in a
From playlist Graph Theory part-10
From playlist 3d graphs
Random forests and hyperbolic symmetry - Roland Bauerschmidt
Special Seminar Topic: Random forests and hyperbolic symmetry Speaker: Roland Bauerschmidt Affiliation: University of Cambridge Date: November 10, 2021 Given a finite graph, the arboreal gas is the measure on forests (subgraphs without cycles) in which each edge is weighted by a paramete
From playlist Mathematics
Stoer-Wagner: a simple min-cut algorithm
This isn't a thriller unfortunately... but it is a description of a simple min-cut algorithm [1]! #SoME1 Contents 0:00 Intro 0:29 Definitions 1:23 Intuition 2:27 Algorithm 4:21 Running Time 6:55 Correctness 11:35 Haiku [1] Stoer, Mechthild, and Frank Wagner. "A simple min cut algorithm."
From playlist Summer of Math Exposition Youtube Videos
The expected difference between N(f) and MF(f)
A talk about Nielsen theory at the 2016 conference on Nielsen Theory and related topics at UNESP Rio Claro, SP Brazil. Given July 5, 2016. Conference website: http://igce.rc.unesp.br/#!/departamentos/matematica/nielsen-theory/ Link to Chris Staecker webarea: http://cstaecker.fairfield.ed
From playlist Research & conference talks
Samir Shukla (3/31/23): Vietoris-Rips complexes of hypercube graphs
In this talk, we discuss the Vietoris-Rips complexes of hypercube graphs. These questions on hypercubes arose from work by Kevin Emmett, Raúl Rabadán, and Daniel Rosenbloom related to the persistent homology formed from genetic trees, reticulate evolution, and medial recombination. A (fin
From playlist Vietoris-Rips Seminar
Modeling Chemical Reaction Networks with Token-Event Graphs
The recent addition of PatternReaction and ApplyReaction to the Wolfram Language now allows the user to programmatically manipulate the atoms and bonds in Molecule objects in a chemically meaningful way. This talk will show how these functions can be used with token-event graphs to model c
From playlist Wolfram Technology Conference 2022
Quiz: Composition of Functions (Graph & Table)
Link: https://www.geogebra.org/m/QgN7nwCh
From playlist Algebra 1: Dynamic Interactives!
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
Marek Filakovský: Embeddings and Tverberg-Type Problems: New Algorithms and Undecidability Results
Title: Embeddings and Tverberg-Type Problems: New Algorithms and Undecidability Results Abstract: We present two new results in computational topology. The first result, joint with Uli Wagner and Stephan Zhechev, concerns the algorithmic embeddability problem, i.e. given a k-dimensional s
From playlist ATMCS/AATRN 2020
From playlist 3d graphs
Gallai-Edmonds Percolation by Kedar Damle
DISCUSSION MEETING : STATISTICAL PHYSICS OF COMPLEX SYSTEMS ORGANIZERS : Sumedha (NISER, India), Abhishek Dhar (ICTS-TIFR, India), Satya Majumdar (University of Paris-Saclay, France), R Rajesh (IMSc, India), Sanjib Sabhapandit (RRI, India) and Tridib Sadhu (TIFR, India) DATE : 19 December
From playlist Statistical Physics of Complex Systems - 2022
The Unforgiven: Wagner, Jews, and Antisemitism
On April 28, 2021, the Yale Program for the Study of Antisemitism hosted a webinar with Alex Ross, the music critic of The New Yorker magazine entitled “Unforgiven: Wagner, Jews, and Antisemitism.” In a 30-minute presentation, Ross discussed the debate over Wagner’s hatred of Jews, from
From playlist Yale Program for the Study of Antisemitism Lecture Series
Graph of x^2 + y^2 + pxy as p varies
From playlist 3d graphs
