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

10 papers · 1 filter

math.CO2016

Optimal Threshold for a Random Graph to be 2-Universal

Asaf Ferber, Gal Kronenberg, Kyle Luh

For a family of graphs $F$ , a graph $G$ is $F$ -universal if $G$ contains every graph in $F$ as a (not necessarily induced) subgraph. For the family of…

math.CO2016

Counting Hamilton decompositions of oriented graphs

Asaf Ferber, Eoin Long, Benny Sudakov

A Hamilton cycle in a directed graph $G$ is a cycle that passes through every vertex of $G$ . A Hamiltonian decomposition of $G$ is a partition of its edge set into disjoint Hamilto…

math.CO2016

Resilience for the Littlewood-Offord Problem

Afonso S. Bandeira, Asaf Ferber, Matthew Kwan

Consider the sum $X (ξ) = \sum_{i = 1}^{n} a_{i} ξ_{i}$ , where $a = (a_{i})_{i = 1}^{n}$ is a sequence of non-zero reals and $ξ = (ξ_{i})_{i = 1}^{n}$ is a sequence of i.i.d. Rademacher random variables (that…

math.CO2016

Packing Loose Hamilton Cycles

Asaf Ferber, Kyle Luh, Daniel Montealegre +1

A subset $C$ of edges in a $k$ -uniform hypergraph $H$ is a \emph{loose Hamilton cycle} if $C$ covers all the vertices of $H$ and there exists a cyclic ordering of these vertices su…

math.CO2016★ 13 cited

Packing trees of unbounded degrees in random graphs

Asaf Ferber, Wojciech Samotij

In this paper, we address the problem of packing large trees in $G_{n, p}$ . In particular, we prove the following result. Suppose that $T_{1}, \dots, T_{N}$ are $n$ -vertex trees, each…

math.CO2016

Packing perfect matchings in random hypergraphs

Asaf Ferber, Van Vu

We introduce a new procedure for generating the binomial random graph/hypergraph models, referred to as \emph{online sprinkling}. As an illustrative application of this method, we…