R. Yuster

activity

20012004

most citedDense graphs are antimagic

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

collaborators

Showing 2002Show all

5 papers · 1 filter

math.CO2002

The order of monochromatic subgraphs with a given minimum degree

Yair Caro, Raphael Yuster

Let $G$ be a graph. For a given positive integer $d$ , let $f_{G} (d)$ denote the largest integer $t$ such that in every coloring of the edges of $G$ with two colors there is a monochr…

math.CO2002

Families of trees decompose the random graph in any arbitrary way

Raphael Yuster

Let $F = {H_{1}, ..., H_{k}}$ be a family of graphs. A graph $G$ with $m$ edges is called {\em totally $F$ -decomposable} if for {\em every} linear combination of the form $α_1 e(H_1) + .…

math.CO2002

Tiling transitive tournaments and their blow-ups

Raphael Yuster

Let $T T_{k}$ denote the transitive tournament on $k$ vertices. Let $T T (h, k)$ denote the graph obtained from $T T_{k}$ by replacing each vertex with an independent set of size $h \geq 1$ …

math.CO2002

Edge coloring complete uniform hypergraphs with many components

Yair Caro, Raphael Yuster

Let $H$ be a hypergraph. For a $k$ -edge coloring $c : E (H) \to {1, ..., k}$ let $f (H, c)$ be the number of components in the subhypergraph induced by the color class with the least…

math.CO2002

Equitable coloring of k-uniform hypergraphs

Raphael Yuster

Let $H$ be a $k$ -uniform hypergraph with $n$ vertices. A {\em strong $r$ -coloring} is a partition of the vertices into $r$ parts, such that each edge of $H$ intersects each part. A…