35 citations · 146 across the 49 of their papers we have counts for
6 papers · 1 filter
Towards the linear arboricity conjecture
Asaf Ferber, Jacob Fox, Vishesh Jain
The linear arboricity of a graph , denoted by , is the minimum number of edge-disjoint linear forests (i.e. forests in which every connected component is a path) i…
Singularity of random symmetric matrices -- a combinatorial approach to improved bounds
Asaf Ferber, Vishesh Jain
Let denote a random symmetric matrix whose upper diagonal entries are independent and identically distributed Bernoulli random variables (which take values a…
On the number of Hadamard matrices via anti-concentration
Asaf Ferber, Vishesh Jain, Yufei Zhao
Many problems in combinatorial linear algebra require upper bounds on the number of solutions to an underdetermined system of linear equations , where the coordinates of th…
Long monotone trails in random edge-labelings of random graphs
Omer Angel, Asaf Ferber, Benny Sudakov +1
Given a graph and a bijection , we say that a trail/path in is -\emph{increasing} if the labels of consecutive edges of this t…
1-factorizations of pseudorandom graphs
Asaf Ferber, Vishesh Jain
A -factorization of a graph is a collection of edge-disjoint perfect matchings whose union is . A trivial necessary condition for to admit a -factorization is t…
Number of 1-factorizations of regular high-degree graphs
Asaf Ferber, Vishesh Jain, Benny Sudakov
A -factor in an -vertex graph is a collection of vertex-disjoint edges and a -factorization of is a partition of its edges into edge-disjoint -fac…