44 citations · 113 across the 33 of their papers we have counts for
4 papers · 1 filter
An alternative proof of the linearity of the size-Ramsey number of paths
Andrzej Dudek, Pawel Pralat
The size Ramsey number of a graph is the smallest integer such that there exists a graph on edges with the property that any colouring of the edges of…
Acquaintance time of random graphs near connectivity threshold
Andrzej Dudek, Paweł Prałat
Benjamini, Shinkar, and Tsur stated the following conjecture on the acquaintance time: asymptotically almost surely for a random graph $G \in G(n,p…
Approximate Counting of Matchings in -Hypergraphs
Andrzej Dudek, Marek Karpinski, Andrzej Ruciński +1
We design a fully polynomial time approximation scheme (FPTAS) for counting the number of matchings (packings) in arbitrary 3-uniform hypergraphs of maximum degree three, referred…
The Total Acquisition Number of Random Graphs
Deepak Bal, Patrick Bennett, Andrzej Dudek +1
Let be a graph in which each vertex initially has weight 1. In each step, the weight from a vertex can be moved to a neighbouring vertex , provided that the weight on $v…