Y. Caro

activity

20022026

most citedUpper bounds on the k-forcing number of a graph

10 citations · 46 across the 64 of their papers we have counts for

collaborators

Showing 2015Show all

3 papers · 1 filter

math.CO2015

Partial domination - the isolation number of a graph

Yair Caro, Adriana Hansberg

We prove the following result: If $G$ be a connected graph on $n \geq 6$ vertices, then there exists a set of vertices $D$ with $∣ D ∣ \leq \frac{n}{3}$ and such that $V(G) \setminus N…

math.CO2015★ 1 cited

Selective Hypergraph Colourings

Yair Caro, Josef Lauri, Christina Zarb

We look at colourings of $r$ -uniform hypergraphs, focusing our attention on unique colourability and gaps in the chromatic spectrum. The pattern of an edge $E$ in an $r$ -uniform hy…

math.CO2015

Ramsey numbers for degree monotone paths

Yair Caro, Raphael Yuster, Christina Zarb

A path $v_{1}, v_{2}, \dots, v_{m}$ in a graph $G$ is $d e g r ee$ - $m o n o t o n e$ if $d e g (v_{1}) \leq d e g (v_{2}) \leq \dots \leq d e g (v_{m})$ where $d e g (v_{i})$ is the degree of $v_{i}$ in $G$ . Longest degr…