S. Radziszowski

activity

20192026

collaborators

5 papers

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

Some Upper Bounds on Ramsey Numbers Involving $C_{4}$

Luis Boza, Stanisław Radziszowski

We obtain some new upper bounds on the Ramsey numbers of the form $R (m C_{4}, \dots, C_{4}, G_{1}, \dots, G_{n})$ , where $m \geq 1$ and $G_{1}, \dots, G_{n}$ are arbitrary graphs. We fo…

cs.CC2023

The Complexity of $(P_{k}, P_{ℓ})$ -Arrowing

Zohair Raza Hassan, Edith Hemaspaandra, Stanisław Radziszowski

For fixed nonnegative integers $k$ and $ℓ$ , the $(P_{k}, P_{ℓ})$ -Arrowing problem asks whether a given graph, $G$ , has a red/blue coloring of $E (G)$ such that there are no red co…

math.CO2021

On Some Generalized Vertex Folkman Numbers

Zohair Raza Hassan, Yu Jiang, David E. Narváez +2

For a graph $G$ and integers $a_{i} \geq 1$ , the expression $G \to (a_{1}, \dots, a_{r})^{v}$ means that for any $r$ -coloring of the vertices of $G$ there exists a monochromatic $a_{i}$ -…

math.CO2019

Failed power domination on graphs

Abraham Glasser, Bonnie Jacob, Emily Lederman +1

Let $G$ be a simple graph with vertex set $V$ and edge set $E$ , and let $S \subseteq V$ . The \emph{open neighborhood} of $v \in V$ , $N (v)$ , is the set of vertices adjacent to $v$ ;…

On Small Folkman Graphs Arrowing K2​ or K3​

Some Upper Bounds on Ramsey Numbers Involving C4​

The Complexity of (Pk​,Pℓ​)-Arrowing

On Some Generalized Vertex Folkman Numbers

Failed power domination on graphs

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

Some Upper Bounds on Ramsey Numbers Involving $C_{4}$

The Complexity of $(P_{k}, P_{ℓ})$ -Arrowing