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 - Line graph - Document - PDFSEARCH.IO

First Page	Meta Content
	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 Document Date: 2012-10-08 01:29:12 Open Document File Size: 119,92 KB Share Result on Facebook SocialTag Cubes Hypercube Graph Hypercube graph Induced path Graph theory Geometry Mathematics

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 colAdd to Reading List