35 citations · 146 across the 49 of their papers we have counts for
63 papers · 1 filter
On the edge expansion of random polytopes
Asaf Ferber, Michael Krivelevich, Marcelo Sales +1
A -polytope in is the convex hull of a subset of . The graph of a polytope is the graph whose vertices are the zero-dimensional faces of and…
Sharp Threshold for Cliques in Random 0/1 Polytope Graphs
Catherine Babecki, Tycho Elling, Asaf Ferber
We study graph-theoretic properties of random polytopes. Specifically, let be a random subset where each point is included independently with prob…
Minimum degree edge-disjoint Hamilton cycles in random directed graphs
Asaf Ferber, Adva Mond
In this paper we consider the problem of finding ``as many edge-disjoint Hamilton cycles as possible'' in the binomial random digraph . We show that a typical co…
Regular bipartite decompositions of pseudorandom graphs
Asaf Ferber, Bryce Frederickson, Dingjia Mao +2
In 1972, Kotzig proved that for every even , the complete graph can be decomposed into edge-disjoint regular bipartite spanning subgraphs, which is b…
Covering Random Digraphs with Hamilton Cycles
Asaf Ferber, Marcelo Sales, Mason Shurman
A covering of a digraph by Hamilton cycles is a collection of directed Hamilton cycles (not necessarily edge-disjoint) that together cover all the edges of . We prove that f…
Sunflowers in set systems with small VC-dimension
József Balogh, Anton Bernshteyn, Michelle Delcourt +2
A family of distinct sets is an -sunflower if for all and , we have $A_i \cap A_j = A_…