Uni Maths
Taster
Dr. Paul Johnson
Paul
Fun and useful
Topology Joke
Henry Segerman
Locally looks 2-dimensional
Text
Locally looks n-dimensional
What n-dimensional manifolds are there?
How can we tell different manifolds apart?
What manifold do we live in?
Janna Levin, How the Universe got its Spots
Could we be seeing the same thing from multiple directions?
But how can we know for sure?
How can we prove it?
Can we check every single possible way of connecting them, or are there infinite many different possibilities to try?
If it were possible, some connections would make a loop.
That loop would have an inside and an outside...
Text
"Epidemic dynamics on higher-dimensional small world networks"
Definition: A graph is planar if it can be drawn on a piece of paper without any edges crossing.
Definition: The complete graph on n vertices, written K_n, is the graph with n vertices, and an edge between every pair of vertices
Definition: The complete bipartite graph K_{n,m} has n red vertices, m blue vertices, and an edge between every red vertex and every blue vertex.
Utilities Question: Is K_{3,3} planar?
What about other graphs?
If a graph is drawn on a plane, cuts the plane up into pieces called faces.
Graph Vertices Edges Faces
Cube
Tetrahedron
Octahedron
Square Pyramid
Your Example
Notice any patterns?
The n-cycle C_n
For any graph G drawn on the plane, we have:
E-V+F=2
Video game graph:
Locally, it looks like a grid: