Steven Van Overberghe

collaborators

5 papers

math.CO2026

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.CO2026

Bounds for the ratio between the domination number and the independent 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

On Small Folkman Graphs Arrowing $K_{2}$ or $K_{3}$

Zohair Raza Hassan, StanisÅaw Radziszowski, Steven Van Overberghe

For a graph $G$ and integers $a_{i} \geq 1$ , we say that $G (a_{1}, \dots, a_{k})^{v}$ if in any $k$ -coloring of $G$ 's vertices there exists a monochromatic $a_{i}$ -clique…

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.CO2024

Small Ramsey numbers for books, wheels, and generalizations

Bernard LidickÃ½, Gwen McKinley, Florian Pfender +1

In this work, we give several new upper and lower bounds on Ramsey numbers for books and wheels, including a tight upper bound establishing $R (W_{5}, W_{7}) = 15$ , matching upper and l…

Some remarks on Folkman graphs for triangles

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

On Small Folkman Graphs Arrowing K2​ or K3​

Algorithms for the Generation of Snarks

Small Ramsey numbers for books, wheels, and generalizations

On Small Folkman Graphs Arrowing $K_{2}$ or $K_{3}$