R. Yuster

activity

20012004

most citedDense graphs are antimagic

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

collaborators

Showing 2004Show all

2 papers · 1 filter

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…