A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Finding unavoidable colorful patterns in multicolored graphs
[article]
2020
arXiv
pre-print
We provide multicolored and infinite generalizations for a Ramsey-type problem raised by Bollobás, concerning colorings of K_n where each color is well-represented. Let χ be a coloring of the edges of a complete graph on n vertices into r colors. We call χ ε-balanced if all color classes have ε fraction of the edges. Fix some graph H, together with an r-coloring of its edges. Consider the smallest natural number R_ε^r(H) such that for all n≥ R_ε^r(H), all ε-balanced colorings χ of K_n contain a
arXiv:1807.02780v3
fatcat:d7e35j5livdzlfcks33fdbbk4m