Density of monochromatic infinite subgraphs II
In 1967, Gerencsér and Gyárfás [16] proved a result which is considered the starting point of graph-Ramsey theory: In every 2-coloring of $K_n$ , there is a monochromatic path on $\lceil (2n+1)/3\rceil $ vertices, and this is best possible. There have since been hundreds of papers on gr...
Збережено в:
| Автори: | , , |
|---|---|
| Формат: | Artigo |
| Мова: | Inglês |
| Опубліковано: |
Cambridge University Press
2025-01-01
|
| Серія: | Forum of Mathematics, Sigma |
| Предмети: | |
| Онлайн доступ: | https://www.cambridge.org/core/product/identifier/S2050509425000428/type/journal_article |
| Теги: |
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|