Ramsey's theorem (Q918099)
combinatorics theorem that any edge labeling of a sufficiently large complete graph contains monochromatic cliques
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Ramsey's theorem |
combinatorics theorem that any edge labeling of a sufficiently large complete graph contains monochromatic cliques |
Statements
Combinatorics
0 references
Identifiers
Sitelinks
Wikipedia(20 entries)
- arwiki مبرهنة رامزي
- dewiki Satz von Ramsey
- elwiki Θεώρημα Ράμσεϋ
- enwiki Ramsey's theorem
- eswiki Teorema de Ramsey
- fawiki قضیه رمزی
- frwiki Théorème de Ramsey
- hewiki משפט רמזי
- huwiki Ramsey-tétel
- itwiki Teorema di Ramsey
- jawiki ラムゼーの定理
- kkwiki Рамсей теоремасы
- kowiki 램지의 정리
- plwiki Twierdzenie Ramseya
- ptwiki Teorema Finito de Ramsey
- ruwiki Теорема Рамсея
- tawiki ராம்சே தேற்றம்
- thwiki จำนวนแรมซีย์
- ukwiki Теорема Ремзі
- zhwiki 拉姆齐定理