1 The Ramsey number R(G1, G2) is the smallest integer p such that for any graph G on p vertices2 either G contains G1 or G contains G2, where G denotes the complement of G. In this...
For a given positive integer k, sr(m, k) denotes the minimal positive integer such that every coloring of [n], n ≥ sr(m, k), that uses each color at most k times, yields a rainb...
We obtain new lower and upper bounds for the maximum multiplicity of some weighted and, respectively, non-weighted common geometric graphs drawn on n points in the plane in genera...
In recent years, many works have been carried out to solve over-constrained problems, and more speci cally the Maximal Constraint Satisfaction Problem (Max-CSP), where the goal is ...