Chromatic Ramsey numbers and two-color Turán densities

Maria Axenovich, Simon Gaa, Dingyuan Liu

Given a graph $G$, its $2$-color Turán number ${\mathrm{ex}}^{(2)}(n,G)$ is the maximum number of edges in an $n$-vertex graph, such that the edges can be colored with two colors av…