Asaf Ferber

activity

20102025

most citedHitting time results for Maker-Breaker games

35 citations · 146 across the 49 of their papers we have counts for

collaborators

Showing 2020Show all

7 papers · 1 filter

cs.IT2020

List-decodability with large radius for Reed-Solomon codes

Asaf Ferber, Matthew Kwan, Lisa Sauermann

List-decodability of Reed-Solomon codes has received a lot of attention, but the best-possible dependence between the parameters is still not well-understood. In this work, we focu…

math.CO2020

Singularity of sparse random matrices: simple proofs

Asaf Ferber, Matthew Kwan, Lisa Sauermann

Consider a random $n \times n$ zero-one matrix with "density" $p$ , sampled according to one of the following two models: either every entry is independently taken to be one with pro…

math.CO2020

Lower bounds for multicolor Ramsey numbers

David Conlon, Asaf Ferber

We give an exponential improvement to the lower bound on diagonal Ramsey numbers for any fixed number of colors greater than two.

math.CO2020

Every graph contains a linearly sized induced subgraph with all degrees odd

Asaf Ferber, Michael Krivelevich

We prove that every graph $G$ on $n$ vertices with no isolated vertices contains an induced subgraph of size at least $n /10000$ with all degrees odd. This solves an old and well-kn…

math.PR2020

Singularity of random symmetric matrices -- simple proof

Asaf Ferber

In this paper we give a simple, short, and self-contained proof for a non-trivial upper bound on the probability that a random $\pm 1$ symmetric matrix is singular.

math.CO2020

Dirac-type theorems in random hypergraphs

Asaf Ferber, Matthew Kwan

For positive integers $d < k$ and $n$ divisible by $k$ , let $m_{d} (k, n)$ be the minimum $d$ -degree ensuring the existence of a perfect matching in a $k$ -uniform hypergraph. In the gr…