44 citations · 113 across the 33 of their papers we have counts for
5 papers · 1 filter
Large triangle packings and Tuza's conjecture in sparse random graphs
Patrick Bennett, Andrzej Dudek, Shira Zerbib
The triangle packing number of a graph is the maximum size of a set of edge-disjoint triangles in . Tuza conjectured that in any graph there exists a set of at mo…
Note on the multicolour size-Ramsey number for paths
Andrzej Dudek, Paweł Prałat
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 o…
A random variant of the game of plates and olives
Andrzej Dudek, Sean English, Alan Frieze
The game of plates and olives was originally formulated by Nicolaescu and encodes the evolution of the topology of the sublevel sets of Morse functions. We consider a random varian…
Monochromatic loose paths in multicolored -uniform cliques
Andrzej Dudek, Andrzej Ruciński
For integers and , a -uniform hypergraph is called a loose path of length , and denoted by , if it consists of edges $e_1,\dots,e…
Minimizing the number of 5-cycles in graphs with given edge-density
Patrick Bennett, Andrzej Dudek, Bernard Lidický +1
Motivated by the work of Razborov about the minimal density of triangles in graphs we study the minimal density of the 5-cycle . We show that every graph of order and size…