That's a pretty big number

Aug 10, 2001
10,420
2
0
EDIT: My previous rough definition was way too small. I give up.

It's an upper bound to the following yet to be solved problem:

Consider an n-dimensional hypercube, and connect each pair of vertices to obtain a complete graph on 2n vertices. Then colour each of the edges of this graph using only the colours red and black. What is the smallest value of n for which every possible such colouring must necessarily contain a single-coloured complete sub-graph with 4 vertices which lie in a plane?

 

Savarak

Platinum Member
Oct 27, 2001
2,718
1
81
Savarak's number draft 1 is 10 raised to a number that has 10^81 zeroes