A conjecture concerning Ramsey's theorem
β
Martin Erickson
π
Article
π
1994
π
Elsevier Science
π
English
β 204 KB
## P(c, m). If the edges of a countable injinite complete graph G are exactly c-colored, then there exists a countable infinite complete subgraph H of G whose edges are exactly m-colored. The purpose of this note is to inquire as to which pairs c, m of positive integers make P(c, m) a true stateme