A Purely Entropic Approach to the Rainbow Triangle Problem
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866916330271145984 |
|---|---|
| author | Chao, Ting-Wei Yu, Hung-Hsun Hans |
| author_facet | Chao, Ting-Wei Yu, Hung-Hsun Hans |
| contents | In this short note, we present a purely entropic proof that in a $3$-edge-colored simple graph with $R$ red edges, $G$ green edges, and $B$ blue edges, the number of rainbow triangles is at most $\sqrt{2RGB}$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_14084 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A Purely Entropic Approach to the Rainbow Triangle Problem Chao, Ting-Wei Yu, Hung-Hsun Hans Combinatorics Information Theory 05D05, 05D40, 94A17 In this short note, we present a purely entropic proof that in a $3$-edge-colored simple graph with $R$ red edges, $G$ green edges, and $B$ blue edges, the number of rainbow triangles is at most $\sqrt{2RGB}$. |
| title | A Purely Entropic Approach to the Rainbow Triangle Problem |
| topic | Combinatorics Information Theory 05D05, 05D40, 94A17 |
| url | https://arxiv.org/abs/2407.14084 |