Two-dimensional graph

#	Item
11	Graham’s Problem (and Number) Michael Albanese Consider an n-dimensional hypercube (for n = 2 it’s a square, n = 3 a cube, and so on). Choose two vertices (i.e. corners) and draw a straight line between them. Now col Add to Reading List Source URL: www.maths.adelaide.edu.au Language: English - Date: 2012-10-08 01:29:12 Cubes Hypercube Graph Hypercube graph Induced path Graph theory Geometry Mathematics