Andrzej Dudek

most citedOn some multicolour Ramsey properties of random graphs

6 citations · 6 across the 2 of their papers we have counts for

collaborators

2 papers

math.CO2016★ 6 cited

On some multicolour Ramsey properties of random graphs

Andrzej Dudek, Paweł Prałat

The size-Ramsey number $R^(F)$ of a graph $F$ is the smallest integer $m$ such that there exists a graph $G$ on $m$ edges with the property that any colouring of the edges of…

math.CO2015

On the Ramsey-Turán number with small $s$ -independence number

Patrick Bennett, Andrzej Dudek

Let $s$ be an integer, $f = f (n)$ a function, and $H$ a graph. Define the Ramsey-Turán number $R T_{s} (n, H, f)$ as the maximum number of edges in an $H$ -free graph $G$ of order $n$ with…

On some multicolour Ramsey properties of random graphs

On the Ramsey-Turán number with small s-independence number

On the Ramsey-Turán number with small $s$ -independence number