On 3-coloured tournaments

Details On 3-coloured tournaments On 3-coloured tournaments

2009-04-13

arxiv.org/abs/0904.1967v2

Mathematics

Combinatorics

We found out that our main result had appeared before (in [3]), and updated the paper to add this information

Scientific paper

We (re-)prove that in every 3-edge-coloured tournament in which no vertex is
incident with all colours there is either a cyclic rainbow triangle or a vertex
dominating every other vertex monochromatically.

Affiliated with

Also associated with

No associations

Rating

On 3-coloured tournaments does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On 3-coloured tournaments, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On 3-coloured tournaments will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-324515