What problem in Ramsey theory is Grahams number used in? Can someone explain this number and what its used for to me? Im afraid im far too simple minded to comprehend, but holy duck I cant contain my curiosity after reading about this.
>Connect each pair of geometric vertices of an n-dimensional hypercube to obtain a complete graph on 2^n vertices. Colour each of the edges of this graph either red or blue. What is the smallest value of n for which every such colouring contains at least one single-coloured complete subgraph on four coplanar vertices?
He worked out that n is between 6 and Graham's number.
>>9074973
How the hell did he get to Grahams number? Is it not too big to work up to even for a computer?