13 citations · 13 across the 3 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2013
Computation of the Ramsey Numbers and
Ivan Livinsky, Alexander Lange, Stanisław Radziszowski
The Ramsey number is the smallest such that any graph on vertices contains a cycle of length four or an independent set of order . With the help of computer…
math.CO2012★ 13 cited
Use of MAX-CUT for Ramsey Arrowing of Triangles
Alexander Lange, Stanisław Radziszowski, Xiaodong Xu
In 1967, Erdős and Hajnal asked the question: Does there exist a -free graph that is not the union of two triangle-free graphs? Finding such a graph involves solving a special…