35 citations · 146 across the 49 of their papers we have counts for
5 papers · 1 filter
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_…
A quantum algorithm for learning a graph of bounded degree
Asaf Ferber, Liam Hardiman
We are presented with a graph, , on vertices with edges whose edge set is unknown. Our goal is to learn the edges of with as few queries to an oracle as possible. Wh…
Hamiltonicity of Sparse Pseudorandom Graphs
Asaf Ferber, Jie Han, Dingjia Mao +1
We show that every -graph contains a Hamilton cycle for sufficiently large , assuming that and , where . This significant…