6 citations · 25 across the 13 of their papers we have counts for
4 papers · 1 filter
On the subgraph query problem
Ryan Alweiss, Chady Ben Hamida, Xiaoyu He +1
Given a fixed graph , a real number , and an infinite Erdős-Rényi graph , how many adjacency queries do we have to make to find a copy of insid…
Improved bounds for the sunflower lemma
Ryan Alweiss, Shachar Lovett, Kewen Wu +1
A sunflower with petals is a collection of sets so that the intersection of each pair is equal to the intersection of all of them. Erdős and Rado proved the sunflower lemma…
Noisy Corruption Detection
Ryan Alweiss
We answer a question of Alon, Mossel, and Pemantle about the corruption detection model on graphs in the noisy setting.
On the product dimension of clique factors
Noga Alon, Ryan Alweiss
The product dimension of a graph is the minimum possible number of proper vertex colorings of so that for every pair of non-adjacent vertices there is at least one co…