New bounds on the generalized Ramsey number $f(n,5,8)$
| Autor: | Gomez-Leos, Enrique, Heath, Emily, Parker, Alex, Schwieder, Coy, Zerbib, Shira |
|---|---|
| Rok vydání: | 2023 |
| Předmět: | |
| Druh dokumentu: | Working Paper |
| Popis: | Let $f(n,p,q)$ denote the minimum number of colors needed to color the edges of $K_n$ so that every copy of $K_p$ receives at least $q$ distinct colors. In this note, we show $\frac{6}{7}(n-1) \leq f(n,5,8) \leq n + o(n)$. The upper bound is proven using the "conflict-free hypergraph matchings method" which was recently used by Mubayi and Joos to prove $f(n,4,5) = \frac{5}{6}n + o(n)$. |
| Databáze: | arXiv |
| Externí odkaz: |
|