Generalized Ramsey numbers: forbidding paths with few colors
The electronic journal of combinatorics, Tome 27 (2020) no. 1
Let $f(K_n, H, q)$ be the minimum number of colors needed to edge-color $K_n$ so that every copy of $H$ is colored with at least $q$ colors. Originally posed by Erdős and Shelah when $H$ is complete, the asymptotics of this extremal function have been extensively studied when $H$ is a complete graph or a complete balanced bipartite graph. Here we investigate this function for some other $H$, and in particular we determine the asymptotic behavior of $f(K_n, P_v, q)$ for almost all values of $v$ and $q$, where $P_v$ is a path on $v$ vertices.
DOI :
10.37236/8801
Classification :
05C55, 05D10, 05C15
Mots-clés : Ramsey problem
Mots-clés : Ramsey problem
Affiliations des auteurs :
Robert A. Krueger  1
@article{10_37236_8801,
author = {Robert A. Krueger},
title = {Generalized {Ramsey} numbers: forbidding paths with few colors},
journal = {The electronic journal of combinatorics},
year = {2020},
volume = {27},
number = {1},
doi = {10.37236/8801},
zbl = {1435.05140},
url = {http://geodesic.mathdoc.fr/articles/10.37236/8801/}
}
Robert A. Krueger. Generalized Ramsey numbers: forbidding paths with few colors. The electronic journal of combinatorics, Tome 27 (2020) no. 1. doi: 10.37236/8801
Cité par Sources :