Oliver Krüger

activity

20172023

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2018

An improved method for recursively computing upper bounds for two-colour Ramsey numbers

Oliver Krüger

The two-colour Ramsey number $R (m, n)$ is the least natural number $p$ such that any graph of order $p$ must contain either a clique of size $m$ or an independent set of size $n$ . W…

math.CO2017

A computerised classification of some almost minimal triangle-free Ramsey graphs

Oliver Krüger

A graph $G$ is called a $(3, j; n)$ -minimal Ramsey graph if it has the least amount of edges, $e (3, j; n)$ , given that $G$ is triangle-free, the independence number $α (G) < j$ and that…