Difference Ramsey numbers and Issai numbers (Q1585507): Difference between revisions

An \(r\)-colored difference graph is a complete graph \(K_n\) with vertex set \(\{1,2,\dots, n\}\) and an \(r\)-edge-coloring constructed as follows: partition \(\{1,2,\dots, n-1\}\) into \(r\) classes \(C_1,C_2,\dots, C_r\), and assign color \(c_k\) to the edge \((i,j)\) if \(|i-j|\in C_k\). For each class \(C_k\) of an \(r\)-colored difference graph, let \(\kappa(C_k)\) be the size of a largest collection of vertices \(\{i_1,\dots, i_m\}\) so that \(|i_p,i_q|\in C_k\), for all \(1\leq p< p\leq m\). The author has produced an algorithm which, given \(h_1\) and \(h_2\), will find the maximum \(n\) and 2-partition of \(\{1,2,\dots, n-1\}\) which form a 2-colored difference graph with the property that \(\kappa(C_i)< h_i\), for \(i= 1,2\). This \(n\) is, of course, a lower bound on the Ramsey number \(R(h_1,h_2)\). The author also uses this algorithm to bound generalized Schur numbers.