35 citations · 146 across the 49 of their papers we have counts for
5 papers · 1 filter
Counting Hamiltonian Cycles in Dirac Hypergraphs
Asaf Ferber, Liam Hardiman, Adva Mond
For , a Hamiltonian -cycle in a -uniform hypergraph is a cyclic ordering of the vertices of in which the edges are segments of length and every…
On subgraphs with degrees of prescribed residues in the random graph
Asaf Ferber, Liam Hardiman, Michael Krivelevich
We show that with high probability the random graph has an induced subgraph of linear size, all of whose degrees are congruent to for any fixed and $q\g…
Random symmetric matrices: rank distribution and irreducibility of the characteristic polynomial
Asaf Ferber, Vishesh Jain, Ashwin Sah +1
Conditional on the extended Riemann hypothesis, we show that with high probability, the characteristic polynomial of a random symmetric -matrix is irreducible. This addr…
Friendly bisections of random graphs
Asaf Ferber, Matthew Kwan, Bhargav Narayanan +2
Resolving a conjecture of Füredi from 1988, we prove that with high probability, the random graph admits a friendly bisection of its vertex set, i.e., a partition of its…
Singularity of the k-core of a random graph
Asaf Ferber, Matthew Kwan, Ashwin Sah +1
Very sparse random graphs are known to typically be singular (i.e., have singular adjacency matrix), due to the presence of "low-degree dependencies'' such as isolated vertices and…