R. Yuster

activity

20012004

most citedDense graphs are antimagic

105 citations · 108 across the 10 of their papers we have counts for

collaborators

13 papers

math.CO2004

Mean Ramsey-Turán numbers

Raphael Yuster

A $ρ$ -mean coloring of a graph is a coloring of the edges such that the average number of colors incident with each vertex is at most $ρ$ . For a graph $H$ and for $ρ \geq 1$ , the {\…

math.CO2004

A Turán Type Problem Concerning the Powers of the Degrees of a Graph (revised)

Y. Caro, R. Yuster

For a graph $G$ whose degree sequence is $d_{1}, ..., d_{n}$ , and for a positive integer $p$ , let $e_{p} (G) = \sum_{i = 1}^{n} d_{i}^{p}$ . For a fixed graph $H$ , let $t_{p} (n, H)$ denote…

math.CO2003★ 3 cited

Asymptotically optimal $K_{k}$ -packings of dense graphs via fractional $K_{k}$ -decompositions

Raphael Yuster

Let $H$ be a fixed graph. A {\em fractional $H$ -decomposition} of a graph $G$ is an assignment of nonnegative real weights to the copies of $H$ in $G$ such that for each $e \in E(G…

math.CO2003

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 $K_{m, n}$ contains $\frac{1}{4 + 8} mn (1 - o (1))$ arc-disjoint directed 4-cycles, improving earlier lower bounds. Combined with a prob…

math.CO2003

Integer and fractional packing of families of graphs

Raphael Yuster

Let $F$ be a family of graphs. For a graph $G$ , the {\em $F$ -packing number}, denoted $ν_{F} (G)$ , is the maximum number of pairwise edge-disjoint elements of ${\…

math.CO2003★ 105 cited

Dense graphs are antimagic

N. Alon, G. Kaplan, A. Lev +2

An {\em antimagic labeling} of a graph with $m$ edges and $n$ vertices is a bijection from the set of edges to the integers $1, ..., m$ such that all $n$ vertex sums are pairwise dis…

Mean Ramsey-Turán numbers

A Turán Type Problem Concerning the Powers of the Degrees of a Graph (revised)

Asymptotically optimal Kk​-packings of dense graphs via fractional Kk​-decompositions

Packing 4-cycles in Eulerian and bipartite Eulerian tournaments with an application to distances in interchange graphs

Integer and fractional packing of families of graphs

Dense graphs are antimagic

Asymptotically optimal $K_{k}$ -packings of dense graphs via fractional $K_{k}$ -decompositions