105 citations · 114 across the 14 of their papers we have counts for
5 papers · 2 filters
Asymptotically optimal -packings of dense graphs via fractional -decompositions
Raphael Yuster
Let be a fixed graph. A {\em fractional -decomposition} of a graph is an assignment of nonnegative real weights to the copies of in such that for each $e \in E(G…
Packing 4-cycles in Eulerian and bipartite Eulerian tournaments with an application to distances in interchange graphs
Raphael Yuster
We prove that every Eulerian orientation of contains arc-disjoint directed 4-cycles, improving earlier lower bounds. Combined with a prob…
Integer and fractional packing of families of graphs
Raphael Yuster
Let be a family of graphs. For a graph , the {\em -packing number}, denoted , is the maximum number of pairwise edge-disjoint elements of ${\…
Dense graphs are antimagic
N. Alon, G. Kaplan, A. Lev +2
An {\em antimagic labeling} of a graph with edges and vertices is a bijection from the set of edges to the integers such that all vertex sums are pairwise dis…
The number of edge disjoint transitive triples in a tournament
Raphael Yuster
We prove that a tournament with vertices has more than edge-disjoint transitive triples. We also prove some results on the existence of large packings of -…