On fractional Ramsey numbers (Q1377687)

Fractional Ramsey numbers \(r_f(x,y)\) are defined as the smallest integer \(n\) such that for any red/blue coloring of the edges of the complete graph \(K_n\) either the red subgraph has the fractional clique number \(x\) or the blue subgraph has the fractional clique number \(y\). The fractional clique number of a graph \(G\) is given as the optimal solution of the LP-relaxation (of the dual) of the IP yielding the chromatic number of \(G\). An exact formula for \(r_f(x,y)\) is given for all \(x,y \geq 2\). Furthermore \(p\)-colorings of the \(K_n\) are considered for \(p \geq 2\) and an exact formula for \(r_f(k,\ldots,k)\), \(k \geq 2\) is derived. In the general case of \(r_f(x_1,\ldots,x_p)\), \(x_1,\ldots,x_p \geq 2\) an analogous formula is conjectured.