A. Dudek

activity

20092023

most citedAn alternative proof of the linearity of the size-Ramsey number of paths

44 citations · 113 across the 33 of their papers we have counts for

collaborators

Showing 2016Show all

4 papers · 1 filter

math.CO2016★ 4 cited

Square of a Hamilton cycle in a random graph

Patrick Bennett, Andrzej Dudek, Alan Frieze

We show that the threshold for the random graph $G_{n, p}$ to contain the square of a Hamilton cycle is $p = \frac{1}{n}$ . This improves the previous results of Kühn and Osthus…

math.CO2016

Size-Ramsey numbers of cycles versus a path

Andrzej Dudek, Farideh Khoeini, Paweł Prałat

The size-Ramsey number $R^(F, H)$ of a family of graphs $F$ and a graph $H$ is the smallest integer $m$ such that there exists a graph $G$ on $m$ edges with…

math.CO2016

Square of Hamilton cycle in a random graph

Andrzej Dudek, Alan Frieze

We show that $p = \frac{e}{n}$ is a sharp threshold for the random graph $G_{n, p}$ to contain the square of a Hamilton cycle. This improves the previous results of Kühn and Os…

math.CO2016

On the number of alternating paths in bipartite complete graphs

Patrick Bennett, Andrzej Dudek, Elliot Laforge

Let $C \subseteq [r]^{m}$ be a code such that any two words of $C$ have Hamming distance at least $t$ . It is not difficult to see that determining a code $C$ with the maximum number…