Publications (39)
On the exact maximum induced density of almost all graphs and their inducibility
Raphael Yuster
Vector clique decompositions
Raphael Yuster
On the size of dissociated bases
Vsevolod F. Lev, Raphael Yuster
Packing 4-cycles in Eulerian and bipartite Eulerian tournaments with an application to distances in interchange graphs
Raphael Yuster
Single source shortest paths in $H$-minor free graphs
Raphael Yuster
Induced subgraphs with many repeated degrees
Yair Caro, Raphael Yuster
The Removal Lemma for Tournaments
Jacob Fox, Lior Gishboliner, Asaf Shapira +1
Dense graphs with a large triangle cover have a large triangle packing
Raphael Yuster
Mean Ramsey-Turán numbers
Raphael Yuster
The Quasi-Randomness of Hypergraph Cut Properties
Asaf Shapira, Raphael Yuster
Quasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets
Raphael Yuster
The domatic number of regular and almost regular graphs
Raphael Yuster
Large feedback arc sets, high minimum degree subgraphs, and long cycles in Eulerian digraphs
Hao Huang, Jie Ma, Asaf Shapira +2
Two-phase algorithms for the parametric shortest path problem
Eldar Fischer, Oded Lachish, Raphael Yuster
The effect of local majority on global majority in connected graphs
Yair Caro, Raphael Yuster
Multigraphs (only) satisfy a weak triangle removal lemma
Asaf Shapira, Raphael Yuster
Hardness and Algorithms for Rainbow Connectivity
Sourav Chakraborty, Eldar Fischer, Arie Matsliah +1
The Turán number of sparse spanning graphs
Noga Alon, Raphael Yuster
Approximating the Diameter of Planar Graphs in Near Linear Time
Oren Weimann, Raphael Yuster
The Effect of Induced Subgraphs on Quasi-Randomness
Asaf Shapira, Raphael Yuster
Asymptotically optimal $K_k$-packings of dense graphs via fractional $K_k$-decompositions
Raphael Yuster
Finding heaviest H-subgraphs in real weighted graphs, with applications
Virginia Vassilevska, Ryan Williams, Raphael Yuster
On the maximum number of spanning copies of an orientation in a tournament
Raphael Yuster
Forcing $k$-repetitions in degree sequences
Yair Caro, Asaf Shapira, Raphael Yuster
The number of edge disjoint transitive triples in a tournament
Raphael Yuster
Ramsey numbers for degree monotone paths
Yair Caro, Raphael Yuster, Christina Zarb
Tiling transitive tournaments and their blow-ups
Raphael Yuster
Acyclic subgraphs with high chromatic number
Safwat Nassar, Raphael Yuster
Integer and fractional packing of families of graphs
Raphael Yuster
Clumsy packings of graphs
Maria Axenovich, Anika Kaufmann, Raphael Yuster
Edge coloring complete uniform hypergraphs with many components
Yair Caro, Raphael Yuster
The order of monochromatic subgraphs with a given minimum degree
Yair Caro, Raphael Yuster
Families of trees decompose the random graph in any arbitrary way
Raphael Yuster
On the Density of a Graph and its Blowup
Asaf Shapira, Raphael Yuster
Computing the diameter polynomially faster than APSP
Raphael Yuster
Packing without some pieces
Raphael Yuster
Equitable coloring of k-uniform hypergraphs
Raphael Yuster
A comment on Ryser's conjecture for intersecting hypergraphs
Toufik Mansour, Chunwei Song, Raphael Yuster
Hardness and Algorithms for Rainbow Connection
Sourav Chakraborty, Eldar Fischer, Arie Matsliah +1