Re:Who Can Name the Bigger Number? (1999)
by maze-le on Wednesday January 22, 2020 @06:22AM
(#22116541)
I think the most fascinating bit about Grahams Number is, that is is used as an upper bound in a proof about colored subgraphs in a completely connected graph of dimension [n]. But this is only an upper bound... the actual number of dimensions [n] that satisfies the proof is unknown, but it could be as low as 13 for all we know...
0: https://en.wikipedia.org/wiki/Graham's_number 1: https://en.wikipedia.org/wiki/Kruskal's_tree_theorem