Tomasz Dzido

activity

20122017

most citedOn Some Zarankiewicz Numbers and Bipartite Ramsey Numbers for Quadrilateral

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

collaborators

Showing math.COShow all

6 papers · 1 filter

math.CO2017

On some three color Ramsey numbers for paths, cycles, stripes and stars

Farideh Khoeini, Tomasz Dzido

For given graphs $G_{1}, G_{2}, ..., G_{k}, k \geq 2$ , the multicolor Ramsey number $R (G_{1}, G_{2}, ..., G_{k})$ is the smallest integer $n$ such that if we arbitrarily color th…

math.CO2017★ 1 cited

Restricted size Ramsey number for $P_{3}$ versus cycles

Joanna Cyman, Tomasz Dzido

Let $F$ , $G$ and $H$ be simple graphs. We say $F \to (G, H)$ if for every $2$ -coloring of the edges of $F$ there exists a monochromatic $G$ or $H$ in $F$ . The Ramsey number…

math.CO2017

The relationship between some nonclassical Ramsey numbers

Tomasz Dzido, Renata Zakrzewska

The upper (mixed) domination Ramsey number $u (m, n)$ ( $v (m, n)$ ) is the smallest integer $p$ such that every $2$ -coloring of the edges of $K_{p}$ with color red and blue, $Γ (B) \geq m$ …

math.CO2014

On-line Ramsey numbers of paths and cycles

Joanna Cyman, Tomasz Dzido, John Lapinskas +1

Consider a game played on the edge set of the infinite clique by two players, Builder and Painter. In each round, Builder chooses an edge and Painter colours it red or blue. Builde…

math.CO2013★ 6 cited

On Some Zarankiewicz Numbers and Bipartite Ramsey Numbers for Quadrilateral

Janusz Dybizbański, Tomasz Dzido, Stanisław Radziszowski

The Zarankiewicz number $z (m, n; s, t)$ is the maximum number of edges in a subgraph of $K_{m, n}$ that does not contain $K_{s, t}$ as a subgraph. The bipartite Ramsey number $b(n_1, \c…

math.CO2012★ 1 cited

On Some Three-Color Ramsey Numbers for Paths