Yair Caro

activity

20122015

most citedPartitions of graphs into small and large sets

4 citations · 6 across the 4 of their papers we have counts for

collaborators

Showing math.COShow all

4 papers · 1 filter

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…

math.CO2014★ 1 cited

Degree Monotone Paths and Graph Operations

Yair Caro, Josef Lauri, Christina Zarb

A path $P$ in a graph $G$ is said to be a degree monotone path if the sequence of degrees of the vertices of $P$ in the order in which they appear on $P$ is monotonic. The length o…

math.CO2012★ 4 cited

Partitions of graphs into small and large sets

Asen Bojilov, Yair Caro, Adriana Hansberg +1

Let $G$ be a graph on $n$ vertices. We call a subset $A$ of the vertex set $V (G)$ \emph{ $k$ -small} if, for every vertex $v \in A$ , $° (v) \leq n - ∣ A ∣ + k$ . A subset $B \subseteq V(G…