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 2018 · math.COShow all

4 papers · 2 filters

math.CO2018

Towards the linear arboricity conjecture

Asaf Ferber, Jacob Fox, Vishesh Jain

The linear arboricity of a graph $G$ , denoted by $la (G)$ , is the minimum number of edge-disjoint linear forests (i.e. forests in which every connected component is a path) i…

math.CO2018★ 1 cited

Long monotone trails in random edge-labelings of random graphs

Omer Angel, Asaf Ferber, Benny Sudakov +1

Given a graph $G$ and a bijection $f : E (G) \to {1, 2, \dots, e (G)}$ , we say that a trail/path in $G$ is $f$ -\emph{increasing} if the labels of consecutive edges of this t…

math.CO2018

1-factorizations of pseudorandom graphs

Asaf Ferber, Vishesh Jain

A $1$ -factorization of a graph $G$ is a collection of edge-disjoint perfect matchings whose union is $E (G)$ . A trivial necessary condition for $G$ to admit a $1$ -factorization is t…

math.CO2018

Number of 1-factorizations of regular high-degree graphs

Asaf Ferber, Vishesh Jain, Benny Sudakov

A $1$ -factor in an $n$ -vertex graph $G$ is a collection of $\frac{n}{2}$ vertex-disjoint edges and a $1$ -factorization of $G$ is a partition of its edges into edge-disjoint $1$ -fac…