Steven Van Overberghe

activity

20212026

collaborators

4 papers

math.CO2026

Bounds for the ratio between the independent domination number and the domination number

Gunnar Brinkmann, Steven Van Overberghe

In this article we present new and improved results for the ratio between the independent domination number and the domination number in graphs with bounded degree. We present a ge…

math.CO2026

Algorithms for the Generation of Snarks

Gunnar Brinkmann, Steven Van Overberghe

The essential requirement for a cubic graph to be called a snark is that it can not be edge-coloured with three colours. To avoid trivial cases, varying restrictions on the connect…

math.CO2025

Some remarks on Folkman graphs for triangles

Eion Mulrenin, Steven Van Overberghe

Folkman's theorem asserts the existence of graphs $G$ which are $K_{4}$ -free, but which have the property that every two-coloring of $E (G)$ contains a monochromatic triangle. The qua…

math.CO2021

New bounds for Ramsey numbers $R (K_{k} - e, K_{l} - e)$

Jan Goedgebeur, Steven Van Overberghe

Let $R (H_{1}, H_{2})$ denote the Ramsey number for the graphs $H_{1}, H_{2}$ , and let $J_{k}$ be $K_{k} - e$ . We present algorithms which enumerate all circulant and block-circulant Ramsey grap…

Bounds for the ratio between the independent domination number and the domination number

Algorithms for the Generation of Snarks

Some remarks on Folkman graphs for triangles

New bounds for Ramsey numbers R(Kk​−e,Kl​−e)

New bounds for Ramsey numbers $R (K_{k} - e, K_{l} - e)$