1 citations · 1 across the 12 of their papers we have counts for
4 papers · 1 filter
Flip colouring of graphs
Yair Caro, Josef Lauri, Xandru Mifsud +2
It is proved that for integers such that , there exists a red/blue edge-colored graph such that the red degree of every vertex is ,…
On tournament inversion
Raphael Yuster
An {\it inversion} of a tournament is obtained by reversing the direction of all edges with both endpoints in some set of vertices. Let be the minimum length o…
Packing and covering a given directed graph in a directed graph
Raphael Yuster
For every fixed , it is proved that if an -vertex directed graph has at most pairwise arc-disjoint directed -cycles, then there exists a set of at most $\frac{2}…
Finding and counting small tournaments in large tournaments
Raphael Yuster
We present new algorithms for counting and detecting small tournaments in a given tournament. In particular, it is proved that every tournament on four vertices (there are four) ca…