Tomasz Dzido
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Tomasz Dzido has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Janusz Dybizbański
Institute of Informatics Faculty of Mathematics, Physics and Informatics University of Gdańsk Wita Stwosza 57 Gdańsk Poland
4 shared publications - Joanna Cyman
Gdansk University of Technology
4 shared publications - Allan Lo
School of Mathematics University of Birmingham Birmingham UK
2 shared publications - Farideh Khoeini
Department of Mathematical Sciences, Isfahan University of Technology, Isfahan, 84156-83111, Iran. s
2 shared publications - John Lapinskas
University of Oxford
2 shared publications - Andrzej Jastrzębski
Institute of Informatics, Gdańsk University of Technology, Wita Stwosza 57, 80-952 Gdańsk, Poland
1 shared publication
Latest Publications
- 31 August 2024
- Published by Springer Nature
- p. 202-214
New Results for Some Turán Problem Instances Obtained Using the Reinforcement Learning Technique
- 31 August 2024
- Published by Springer Nature
- p. 202-214
New Results for Some Turán Problem Instances Obtained Using the Reinforcement Learning Technique
- 26 June 2023
- Published by Springer Nature
- p. 589-596
Applying Reinforcement Learning to Ramsey Problems
- 26 June 2023
- Published by Springer Nature
- p. 589-596
Applying Reinforcement Learning to Ramsey Problems
- Open Access
- 16 October 2020
- Published by The Institute for Research and Community Services (LPPM) ITB in Electronic Journal of Graph Theory and Applications
- Vol. 8 (2) , 365-372
Restricted size Ramsey number for P3 versus cycle
Let F, G and H be simple graphs. We say F → (G,H) if for every 2-coloring of the edges of F there exists a red copy of G or a blue copy of H in F. The Ramsey number r(G,H) is defined as r(G,H) = min{|V(F)|: F → (G,H)}, while the restricted size Ramsey number r*(G,H) is defined as r*(G,H) = min{|E(F)|: F → (G,H),|V(F)| = r(G,H)}. In this paper we determine previously unknown restricted size Ramsey numbers r*(P3,Cn) for 7 ≤ n ≤ 12. We also give new upper bound r*(P3,Cn) ≤ 2n-2 for n ≥ 10 and n is even.
- 16 October 2020
- Published by The Institute for Research and Community Services (LPPM) ITB in Electronic Journal of Graph Theory and Applications
- Vol. 8 (2) , 365-372
Open AccessRestricted size Ramsey number for P3 versus cycle
Let F, G and H be simple graphs. We say F → (G,H) if for every 2-coloring of the edges of F there exists a red copy of G or a blue copy of H in F. The Ramsey number r(G,H) is defined as r(G,H) = min{|V(F)|: F → (G,H)}, while the restricted size Ramsey number r*(G,H) is defined as r*(G,H) = min{|E(F)|: F → (G,H),|V(F)| = r(G,H)}. In this paper we determine previously unknown restricted size Ramsey numbers r*(P3,Cn) for 7 ≤ n ≤ 12. We also give new upper bound r*(P3,Cn) ≤ 2n-2 for n ≥ 10 and n is even.
- Open Access
- 4 February 2019
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 35 (2) , 559-567
On Some Three Color Ramsey Numbers for Paths, Cycles, Stripes and Stars
- 4 February 2019
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 35 (2) , 559-567
Open AccessOn Some Three Color Ramsey Numbers for Paths, Cycles, Stripes and Stars
- Open AccessRestricted size Ramsey number for $P_3$ versus cyclesLet $F$, $G$ and $H$ be simple graphs. We say $F \rightarrow (G, H)$ if for every $2$-coloring of the edges of $F$ there exists a monochromatic $G$ or $H$ in $F$. The Ramsey number $r(G, H)$ is defined as $r(G, H) = min\{|V (F)|: F \rightarrow (G, H)\}$, while the restricted size Ramsey number $r^{*}(G, H)$ is defined as $r^{*}(G, H) = min\{|E (F)|: F \rightarrow (G, H) , |V (F) | = r(G, H)\}$. In this paper we determine previously unknown restricted size Ramsey numbers $r^{*}(P_3, C_n)$ for $7 \leq n \leq 12$. We also give new upper bound $r^{*}(P_3, C_n) \leq 2n-2$ for even $n \geq 8$.Open AccessRestricted size Ramsey number for $P_3$ versus cyclesLet $F$, $G$ and $H$ be simple graphs. We say $F \rightarrow (G, H)$ if for every $2$-coloring of the edges of $F$ there exists a monochromatic $G$ or $H$ in $F$. The Ramsey number $r(G, H)$ is defined as $r(G, H) = min\{|V (F)|: F \rightarrow (G, H)\}$, while the restricted size Ramsey number $r^{*}(G, H)$ is defined as $r^{*}(G, H) = min\{|E (F)|: F \rightarrow (G, H) , |V (F) | = r(G, H)\}$. In this paper we determine previously unknown restricted size Ramsey numbers $r^{*}(P_3, C_n)$ for $7 \leq n \leq 12$. We also give new upper bound $r^{*}(P_3, C_n) \leq 2n-2$ for even $n \geq 8$.
- 1 April 2018
- Published by Elsevier in Discrete Mathematics
- Vol. 341 (4) , 1150-1154
Turán numbers for odd wheels
- 1 April 2018
- Published by Elsevier in Discrete Mathematics
- Vol. 341 (4) , 1150-1154
Turán numbers for odd wheels
- Open Access
On some three color Ramsey numbers for paths, cycles, stripes and stars
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 the edges of the complete graph of order $n$ with $k$ colors, then it always contains a monochromatic copy of $G_{i}$ colored with $i$, for some $1 \leq i \leq k$. The bipartite Ramsey number $b(G_1, \cdots, G_k)$ is the least positive integer $b$ such that any coloring of the edges of $K_{b,b}$ with $k$ colors will result in a monochromatic copy of bipartite $G_i$ in the $i$-th color, for some $i$, $1 \le i \le k$. There is very little known about $R(G_{1},\ldots, G_{k})$ even for very special graphs, there are a lot of open cases. In this paper, by using bipartite Ramsey numbers we obtain the exact values of some multicolor Ramsey numbers. We show that for sufficiently large $n_{0}$ and three following cases: 1. $n_{1}=2s$, $n_{2}=2m$ and $m-1<2s$, 2. $n_{1}=n_{2}=2s$, 3. $n_{1}=2s+1$, $n_{2}=2m$ and $s<m-1<2s+1$, we have $$R(C_{n_0}, P_{n_{1}},P_{n_{2}}) = n_0 + \Big \lfloor \frac{n_1}{2} \Big \rfloor + \Big \lfloor \frac{n_2}{2} \Big \rfloor -2.$$ We prove that $R(P_n,kK_{2},kK_{2})=n+2k-2$ for large $n$. In addition, we prove that for even $k$, $R((k-1)K_{2},P_{k},P_{k})=3k-4$. For $s < m-1<2s+1$ and $t\geq m+s-1$, we obtain that $R(tK_{2},P_{2s+1},P_{2m})=s+m+2t-2$ where $P_{k}$ is a path on $k$ vertices and $tK_{2}$ is a matching of size $t$. We also provide some new exact values or generalize known results for other multicolor Ramsey numbers of paths, cycles, stripes and stars versus other graphs.Open AccessOn some three color Ramsey numbers for paths, cycles, stripes and stars
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 the edges of the complete graph of order $n$ with $k$ colors, then it always contains a monochromatic copy of $G_{i}$ colored with $i$, for some $1 \leq i \leq k$. The bipartite Ramsey number $b(G_1, \cdots, G_k)$ is the least positive integer $b$ such that any coloring of the edges of $K_{b,b}$ with $k$ colors will result in a monochromatic copy of bipartite $G_i$ in the $i$-th color, for some $i$, $1 \le i \le k$. There is very little known about $R(G_{1},\ldots, G_{k})$ even for very special graphs, there are a lot of open cases. In this paper, by using bipartite Ramsey numbers we obtain the exact values of some multicolor Ramsey numbers. We show that for sufficiently large $n_{0}$ and three following cases: 1. $n_{1}=2s$, $n_{2}=2m$ and $m-1<2s$, 2. $n_{1}=n_{2}=2s$, 3. $n_{1}=2s+1$, $n_{2}=2m$ and $s<m-1<2s+1$, we have $$R(C_{n_0}, P_{n_{1}},P_{n_{2}}) = n_0 + \Big \lfloor \frac{n_1}{2} \Big \rfloor + \Big \lfloor \frac{n_2}{2} \Big \rfloor -2.$$ We prove that $R(P_n,kK_{2},kK_{2})=n+2k-2$ for large $n$. In addition, we prove that for even $k$, $R((k-1)K_{2},P_{k},P_{k})=3k-4$. For $s < m-1<2s+1$ and $t\geq m+s-1$, we obtain that $R(tK_{2},P_{2s+1},P_{2m})=s+m+2t-2$ where $P_{k}$ is a path on $k$ vertices and $tK_{2}$ is a matching of size $t$. We also provide some new exact values or generalize known results for other multicolor Ramsey numbers of paths, cycles, stripes and stars versus other graphs. - 1 May 2016
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 204, 133-141
On some three-color Ramsey numbers for paths
- 1 May 2016
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 204, 133-141
On some three-color Ramsey numbers for paths
- 1 September 2015
- Published by Institute of Mathematics, Czech Academy of Sciences in Czechoslovak Mathematical Journal
- Vol. 65 (3) , 829-836
Edit distance measure for graphs
In this paper, we investigate a measure of similarity of graphs similar to the Ramsey number. We present values and bounds for g(n, l), the biggest number k guaranteeing that there exist l graphs on n vertices, each two having edit distance at least k. By edit distance of two graphs G, F we mean the number of edges needed to be added to or deleted from graph G to obtain graph F. This new extremal number g(n, l) is closely linked to the edit distance of graphs. Using probabilistic methods we show that g(n, l) is close to \(\frac{1} {2}\left( {\begin{array}{*{20}c} n \\ 2 \\ \end{array} } \right)\) for small values of l > 2. We also present some exact values for small n and lower bounds for very large l close to the number of non-isomorphic graphs of n vertices.- 1 September 2015
- Published by Institute of Mathematics, Czech Academy of Sciences in Czechoslovak Mathematical Journal
- Vol. 65 (3) , 829-836
Edit distance measure for graphs
In this paper, we investigate a measure of similarity of graphs similar to the Ramsey number. We present values and bounds for g(n, l), the biggest number k guaranteeing that there exist l graphs on n vertices, each two having edit distance at least k. By edit distance of two graphs G, F we mean the number of edges needed to be added to or deleted from graph G to obtain graph F. This new extremal number g(n, l) is closely linked to the edit distance of graphs. Using probabilistic methods we show that g(n, l) is close to \(\frac{1} {2}\left( {\begin{array}{*{20}c} n \\ 2 \\ \end{array} } \right)\) for small values of l > 2. We also present some exact values for small n and lower bounds for very large l close to the number of non-isomorphic graphs of n vertices.- 1 June 2015
- Published by Elsevier in Discrete Mathematics
- Vol. 338 (6) , 983-989
On a local similarity of graphs
- 1 June 2015
- Published by Elsevier in Discrete Mathematics
- Vol. 338 (6) , 983-989
On a local similarity of graphs