Timeline for Understanding of Ramsey theorem
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 1 at 18:30 | vote | accept | A. H. | ||
| Jul 1 at 18:02 | comment | added | Andreas Blass | @A.H. Pigeons are the $(k-1)c+1$ steps. Holes are the $c$ colors. PHP says some hole must have $k$ pigeons. (Vincent's answer essentially contains the proof of this form of PHP.) | |
| Jul 1 at 16:43 | comment | added | A. H. | Would you explain, how pigeon hole principle is using here for $(k-1)c?$ My teacher said me to use PHP. | |
| Jul 1 at 16:36 | history | answered | Vincent | CC BY-SA 4.0 |