Publications (66)
Vector clique decompositions
Raphael Yuster
Let be the set of graphs on vertices. For a graph , a -decomposition is a set of induced subgraphs of , each isomorphic to an element of , such that each pa…
On Ramsey Properties of k-Majority Tournaments
Asaf Shapira, Raphael Yuster
A central objective in Ramsey theory is determining whether restricted families of discrete structures necessarily contain substantially larger homogeneous substructures, compared…
On the size of dissociated bases
Vsevolod F. Lev, Raphael Yuster
We prove that the sizes of the maximal dissociated subsets of a given finite subset of an abelian group differ by a logarithmic factor at most. On the other hand, we show that the…
Single source shortest paths in -minor free graphs
Raphael Yuster
We present an algorithm for the Single Source Shortest Paths (SSSP) problem in \emph{-minor free} graphs. For every fixed , if is a graph with vertices having integer…
Perfect and nearly perfect separation dimension of complete and random graphs
Raphael Yuster
The separation dimension of a hypergraph is the smallest natural number for which there is an embedding of into , such that any pair of disjoint edges is…
Inducibility in -free graphs and inducibility of Turán graphs
Raphael Yuster
For graphs and , let denote the inducibility of and let denote the inducibility of over -free graphs. We prove that for almost all graphs on a…