volume 29, issue 2, P223-227 2003
DOI: 10.1007/s00454-002-0780-5
View full text
|
|
Share

Abstract: Let C n denote the set of points in R n whose coordinates are all 0 or 1, i.e., the vertex set of the unit n-cube. Graham and Rothschild [2] proved that there exists an integer N such that for n ≥ N , any 2-coloring of the edges of the complete graph on C n contains a monochromatic plane K 4 . Let N * be the minimum such N . They noted that N * must be at least 6. Their upper bound on N * has come to be known as Graham's number, often cited as the largest number that has ever been put to any practical use. I…

Expand abstract

Search citation statements

Order By: Relevance

Paper Sections

0
0
0
0
0

Citation Types

0
1
0

Publication Types

Select...

Relationship

0
0

Authors

Journals