Showing math.COShow all
4 papers · 1 filter
math.CO2021
Arithmetic Progressions in Sumsets of Sparse Sets
Noga Alon, Ryan Alweiss, Yang P. Liu +2
A set of positive integers is \emph{log-sparse} if there is an absolute constant so that for any positive integer the sequence contains at most…
math.CO2019
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…
math.CO2019
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.
math.CO2019
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…