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 2019Show all

6 papers · 1 filter

math.CO2019★ 4 cited

Resilience of the Rank of Random Matrices

Asaf Ferber, Kyle Luh, Gweneth McKinley

Let $M$ be an $n \times m$ matrix of independent Rademacher ( $\pm 1$ ) random variables. It is well known that if $n \leq m$ , then $M$ is of full rank with high probability. We show…

math.CO2019★ 6 cited

Co-degrees resilience for perfect matchings in random hypergraphs

Asaf Ferber, Lior Hirschfeld

In this paper we prove an optimal co-degrees resilience property for the binomial $k$ -uniform hypergraph model $H_{n, p}^{k}$ with respect to perfect matchings. That is, for a suffici…

math.CO2019★ 14 cited

Almost all Steiner triple systems are almost resolvable

Asaf Ferber, Matthew Kwan

We show that for any n divisible by 3, almost all order-n Steiner triple systems admit a decomposition of almost all their triples into disjoint perfect matchings (that is, almost…

math.CO2019

On the counting problem in inverse Littlewood--Offord theory

Asaf Ferber, Vishesh Jain, Kyle Luh +1

Let $ε_{1}, \dots, ε_{n}$ be i.i.d. Rademacher random variables taking values $\pm 1$ with probability $1/2$ each. Given an integer vector $a = (a_{1}, \dots, a_{n})$ , its c…

math.CO2019★ 3 cited

Uniformity-independent minimum degree conditions for perfect matchings in hypergraphs

Asaf Ferber, Vishesh Jain

In this note, we prove that there exists a universal constant $c = \frac{43}{50}$ such that for every $k \in N$ and every $d < k /2$ , every $k$ -uniform hypergraph on $n$ vertice…

math.CO2019

A quantitative Lovász criterion for Property B

Asaf Ferber, Asaf Shapira

A well known observation of Lovász is that if a hypergraph is not $2$ -colorable, then at least one pair of its edges intersect at a single vertex. %This very simple criterion turne…