105 citations · 175 across the 52 of their papers we have counts for
58 papers
Simultaneous separation in bounded degree trees
Sagi Snir, Raphael Yuster
It follows from a classical result of Jordan that every tree with maximum degree at most containing a vertex set labeled by , has a single-edge cut which separates two sub…
Almost -union closed set systems
Raphael Yuster
In a recent breakthrough, Gilmer proved the union closed conjecture up to a constant factor. Using Gilmer's method and additional ideas, Chase and Lovett proved an optimal result f…
The number of bounded-degree spanning trees
Raphael Yuster
For a graph , let be the number of spanning trees of with maximum degree at most . For , it is proved that every connected -vertex -regular graph…
The covering threshold of a directed acyclic graph by directed acyclic subgraphs
Raphael Yuster
Let be a directed acyclic graph other than a rooted star. It is known that there are constants and such that the following holds for the complete directed graph $…
Hamiltonian cycles above expectation in r-graphs and quasi-random r-graphs
Raphael Yuster
Let denote the maximum number of Hamiltonian cycles in an -vertex -graph with density . The expected number of Hamiltonian cycles in the random -gr…
On the quartet distance given partial information
Sagi Snir, Osnat Weissberg, Raphael Yuster
Let be an arbitrary phylogenetic tree with leaves. It is well-known that the average quartet distance between two assignments of taxa to the leaves of is $\frac 23 \bin…