12 citations · 15 across the 11 of their papers we have counts for
4 papers · 1 filter
Generalized Ramsey numbers at the linear and quadratic thresholds
Patrick Bennett, Ryan Cushman, Andrzej Dudek
The generalized Ramsey number is the smallest number of colors needed to color the edges of the complete graph so that every -clique spans at least colors…
Edge-coloring a graph so that every copy of a graph has an odd color class
Patrick Bennett, Emily Heath, Shira Zerbib
Recently, Alon introduced the notion of an -code for a graph : a collection of graphs on vertex set is an -code if it contains no two members whose symmetric differe…
Larger matchings and independent sets in regular uniform hypergraphs of high girth
Deepak Bal, Patrick Bennett
In this note we analyze two algorithms, one for producing a matching and one for an independent set, on -uniform -regular hypergraphs of large girth. As a result we obtain ne…
Rainbow Greedy Matching Algorithms
Patrick Bennett, Colin Cooper, Alan Frieze
We consider the problem of finding a large rainbow matching in a random graph with randomly colored edges. In particular we analyze the performance of two greedy algorithms for thi…