Y. Caro

collaborators

3 papers

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.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

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…