10 citations · 46 across the 64 of their papers we have counts for
4 papers · 2 filters
Forcing -repetitions in degree sequences
Yair Caro, Asaf Shapira, Raphael Yuster
One of the most basic results in graph theory states that every graph with at least two vertices has two vertices with the same degree. Since there are graphs without vertices…
Non-monochromatic non-rainbow colourings of -hypergraphs
Yair Caro, Josef Lauri
One of the most interesting new developments in hypergraph colourings in these last few years has been Voloshin's notion of colourings of mixed hypergraphs. In this paper we shall…
Regular independent sets
Yair Caro, Adriana Hansberg, Ryan Pepper
The regular independence number, introduced by Albertson and Boutin in 1990, is the size of a largest set of independent vertices with the same degree. Lower bounds were proven for…
Simultaneous Domination in Graphs
Yair Caro, Michael A. Henning
Let be graphs with the same vertex set . A subset is a simultaneous dominating set if for every , , every vertex of …